A Dynamic Programming Approach to De Novo Peptide Sequencing via Tandem Mass Spectrometry
| dc.creator | Chen, Ting | |
| dc.creator | Kao, Ming-Yang | |
| dc.creator | Tepel, Matthew | |
| dc.creator | Rush, John | |
| dc.creator | Church, George M. | |
| dc.date | 2001-01-18 | |
| dc.date.accessioned | 2026-07-07T03:16:51Z | |
| dc.date.available | 2026-07-07T03:16:51Z | |
| dc.description | The tandem mass spectrometry fragments a large number of molecules of the same peptide sequence into charged prefix and suffix subsequences, and then measures mass/charge ratios of these ions. The de novo peptide sequencing problem is to reconstruct the peptide sequence from a given tandem mass spectral data of k ions. By implicitly transforming the spectral data into an NC-spectrum graph G=(V,E) where |V|=2k+2, we can solve this problem in O(|V|+|E|) time and O(|V|) space using dynamic programming. Our approach can be further used to discover a modified amino acid in O(|V||E|) time and to analyze data with other types of noise in O(|V||E|) time. Our algorithms have been implemented and tested on actual experimental data. | |
| dc.description | A preliminary version appeared in Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 389--398, 2000 | |
| dc.identifier | https://arxiv.org/abs/cs/0101016 | |
| dc.identifier | http://arxiv.org/abs/cs/0101016 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30512 | |
| dc.subject | Computational Engineering, Finance, and Science | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | F.2; J.3 | |
| dc.title | A Dynamic Programming Approach to De Novo Peptide Sequencing via Tandem Mass Spectrometry | |
| dc.type | text |