Brute force (Cyclic Peptide Sequencing Problem Cyclic Peptide Sequencing Problem)

From Algorithm Wiki
Revision as of 11:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == ${2}^{O(n)}$ == Space Complexity == $O(n)$? words (Keeps track of current amino acid sequence being checked) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1987 == Reference ==")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

${2}^{O(n)}$

Space Complexity

$O(n)$? words

(Keeps track of current amino acid sequence being checked)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

1987

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Brute_force_(Cyclic_Peptide_Sequencing_Problem_Cyclic_Peptide_Sequencing_Problem)&oldid=44984"