Cyclic Peptide Sequencing Problem: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 30: | Line 30: | ||
[[File:Cyclic Peptide Sequencing Problem - Space.png|1000px]] | [[File:Cyclic Peptide Sequencing Problem - Space.png|1000px]] | ||
== | == Time-Space Tradeoff == | ||
[[File:Cyclic Peptide Sequencing Problem - Pareto Frontier.png|1000px]] | [[File:Cyclic Peptide Sequencing Problem - Pareto Frontier.png|1000px]] | ||
Revision as of 14:47, 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
Time-Space Tradeoff
