Cyclic Peptide Sequencing Problem (Cyclic Peptide Sequencing Problem)
Revision as of 10:25, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Cyclic Peptide Sequencing Problem (Cyclic Peptide Sequencing Problem)}} == Description == Given an experimental $MS^3$ spectrum $S$, find a cyclic peptide $P$ maximizing the number of shared masses between $S$ and the theoretical spectrum of $P$. == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! R...")
Description
Given an experimental $MS^3$ spectrum $S$, find a cyclic peptide $P$ maximizing the number of shared masses between $S$ and the theoretical spectrum of $P$.
Parameters
No parameters found.
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Brute force | 1987 | ${2}^{O(n)}$ | $O(n)$? | Exact | Deterministic | |
| Branch and bound | 1993 | ${2}^{O(n)}$ | $O({2}^{O(n)})$? | Exact | Deterministic |
Time Complexity graph
Space Complexity graph
Pareto Decades graph
