Mass spectrometry has become one of the most popular analysis techniques in Proteomics and Systems Biology. With the creation of larger data sets, the automated recalibration of mass spectra becomes important to ensure that every peak in the sample spectrum is correctly assigned to some peptide and protein. Algorithms for recalibrating mass spectra have to be robust with respect to wrongly assigned peaks, as well as efficient due to the amount of mass spectrometry data. The recalibration of mass spectra leads us to the problem of finding an optimal matching between mass spectra under measurement errors. We have developed two deterministic methods that allow robust computation of such a matching: The first approach uses a computational geometry interpretation of the problem and tries to find two parallel lines with constant distance that stab a maximal number of points in the plane. The second approach is based on finding a maximal common approximate subsequence and improves existing algorithms by one order of magnitude exploiting the sequential nature of the matching problem. We compare our results to a computational geometry algorithm using a topological line sweep.
|Lehti||IEEE/ACM Transactions on Computational Biology and Bioinformatics|
|DOI - pysyväislinkit|
|Tila||Julkaistu - 2008|
|OKM-julkaisutyyppi||A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä, vertaisarvioitu|
- 113 Tietojenkäsittely- ja informaatiotieteet