Peak alignment using restricted edit distances

Biomolecular Engineering

Volumn 24, Issue 3, 2007, Pages 337-342

  Mäkinen, Veli ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Edit distance; Gel electrophoresis; Mass spectrometry; Peak alignment; Sparse dynamic programming

Indexed keywords

DYNAMIC PROGRAMMING; MASS SPECTROMETRY; PROBLEM SOLVING;

EDIT DISTANCES; GEL ELECTROPHORESIS; PEAK ALIGNMENT; SPARSE DYNAMIC PROGRAMMING~;

BIOMOLECULES;

ALGORITHM; ARTICLE; CALIBRATION; COMPUTER PROGRAM; GEL ELECTROPHORESIS; MASS SPECTROMETRY; MATHEMATICAL COMPUTING; MEASUREMENT; PRIORITY JOURNAL; RNA STRUCTURE; SEQUENCE ANALYSIS;

ALGORITHMS; AMINO ACID SEQUENCE; MASS SPECTROMETRY; MOLECULAR SEQUENCE DATA; PEPTIDE MAPPING; PROTEINS; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, PROTEIN;

EID: 34548527349     PISSN: 13890344     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.bioeng.2007.02.007     Document Type: Article

References (16)

1. Aittokallio T., Ojala P., Nevalainen T.J., and Nevalainen O. Automated detection of differentially expressed fragments in mRNA differential display. Electrophoresis 22 10 (2001) 1935-1945
2. Bafna V., and Edwards N. SCOPE: a probabilistic model for scoring tandem mass spectra against a peptide database. Bioinformatics 17 (2001) S13-S21
3. Böcker, S., Kaltenbach, M., 2005. Mass spectra alignments and their significance. In: Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM 2005). Springer-Verlag, LNCS 3537, pp. 429-441.
4. Böcker, S., Mäkinen, V., 2005. Maximum line-pair stabbing problem and its variations. In: Proceedings of the 21st European Workshop on Computational Geometry (EWCG'05). Eindhoven, Netherlands, March 9-11, pp. 183-186.
5. Colinge, J., Maselot, A., Magnin, J., 2003. A systematic statistical analysis of ion trap tandem mass spectra in view of peptide scoring. In: Proceedings of the Workshop on Algorithms in Bioinformatics (WABI 2003). Springer-Verlag, LNCS 2812, pp. 25-38.
6. Crochemore M., and Rytter W. Jewels of Stringology. World Scientific (2002)
7. Durbin R., Eddy S.R., Krogh A., and Mitchison G. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids (1997), Cambridge University Press
8. Eppstein D., Galil Z., Giancarlo R., and Italiano G.F. Sparse dynamic programming. I. Linear cost functions. J. ACM 39 3 (1992) 519-545
9. Gabow, H.N., Bentley, J.L., Tarjan, R.E., 1984. Scaling and related techniques for geometry problems. In: Proceedings of the 16th ACM Symposium on Theory of Computing (STOC'84), pp. 135-143.
10. Hunt J.W., and Szymanski T.G. A fast algorithm for computing longest common subsequences. Commun. ACM 20 5 (1977) 350-353
11. Mäkinen, V., August 2003. Parameterized Approximate String Matching and Local-Similarity-Based Point-Pattern Matching. PhD Thesis, Report A-2003-6. Department of Computer Science, Univ. of Helsinki.
12. Mäkinen V., Navarro G., and Ukkonen E. Transposition Invariant String Matching. J. Algorithms 56 2 (2003) 124-153 earlier in Proc. STACS
13. In: Sankoff D., and Kruskal J.B. (Eds). Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. (1983), Addison-Wesley Publishing Company
14. Levenshtein V. Binary codes capable of correcting deletions, insertions and reversals. Soviet Phys. Doklady 6 (1966) 707-710
15. van Emde P., and Boas. Preserving order in a forest in less than logarithmic time and linear space. Inf. Process. Lett. 6 3 (1977) 80-82
16. van Emde Boas P., Kaas R., and Zijlstra E. Design and implementation of an efficient priority queue. Math. Syst. Theory 10 (1977) 99-127