Cyclic Peptide Sequencing Problem: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 27: | Line 27: | ||
[[File:Cyclic Peptide Sequencing Problem - Time.png|1000px]] | [[File:Cyclic Peptide Sequencing Problem - Time.png|1000px]] | ||
Latest revision as of 09:11, 28 April 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
$n$: size of peptide, in daltons
$m$: number of elements in experimental spectrum
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
Error creating thumbnail: Unable to save thumbnail to destination