Branch and bound (Cyclic Peptide Sequencing Problem Cyclic Peptide Sequencing Problem)
Jump to navigation
Jump to search
Time Complexity
${2}^{O(n)}$
Space Complexity
$O({2}^{O(n)})$ words
(Keeps track of all possible not fully expanded amino acid sequences so far)
Description
Improvement on brute force (despite not doing better asymptotically)
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
1993