Cyclic Peptide Sequencing Problem: Difference between revisions
Jump to navigation
Jump to search
(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...") |
No edit summary |
||
| Line 22: | Line 22: | ||
|} | |} | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:Cyclic Peptide Sequencing Problem - Time.png|1000px]] | [[File:Cyclic Peptide Sequencing Problem - Time.png|1000px]] | ||
== Space Complexity | == Space Complexity Graph == | ||
[[File:Cyclic Peptide Sequencing Problem - Space.png|1000px]] | [[File:Cyclic Peptide Sequencing Problem - Space.png|1000px]] | ||
== Pareto | == Pareto Frontier Improvements Graph == | ||
[[File:Cyclic Peptide Sequencing Problem - Pareto Frontier.png|1000px]] | [[File:Cyclic Peptide Sequencing Problem - Pareto Frontier.png|1000px]] | ||
Revision as of 13:05, 15 February 2023
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 Frontier Improvements Graph
