Multiple sequence comparison - A peptide matching approach

Theoretical Computer Science

Volumn 180, Issue 1-2, 1997, Pages 115-137

  Sagot, Marie France ^a,b   Viari, Alain ^a   Soldano, Henri ^a,c  

^a INSTITUT CURIE   (France)

^b Université de Marne la Vallée   (France)

^c UNIVERSITÉ PARIS 13   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AMINO ACIDS; ERRORS; MATHEMATICAL MODELS; PROTEINS; SET THEORY;

LEVENSHTEIN DISTANCE; MULTIPLE SEQUENCE COMPARISON; PEPTIDE MATCHING;

COMPUTATION THEORY;

EID: 0031163959     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00137-5     Document Type: Article

References (30)

1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, in: The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974).
2. S.F. Altschul, Gap costs for multiple sequence alignment, J. Theor. Biol. 138 (1989) 297-309.
3. S.F. Altschul and D.J. Lipman, Tree, stars, and multiple biological sequence alignment, SIAM J. Appl. Math. 49 (1989) 197-209.
4. S.A. Benner, M.A. Cohen and G.H. Gonnet, Empirical and structural models for insertions and deletions in the divergent evolution of proteins, J. Mol. Biol. 229 (1993) 1065-1082.
5. D.L. Brutlag, J.-P. Dautricourt, S. Maulik and J. Relph, Improved sensitivity of biological sequence database searches, Comput. Applic. Biosci. 6 (1990) 237-245.
6. H. Carrillo and D.J. Lipman, The multiple sequence alignment problem in biology, SIAM J. Appl. Math. 48 (1988) 1073-1083.
7. S.C. Chan, A.K. Wong and D.K. Chiu, A survey of multiple sequence comparison methods, Bull. Math. Biol. 54 (1992) 563-598.
8. A.L. Cobbs, Fast identification of approximately matching substrings, in: M. Crochemore and D. Gusfield, eds., Combinatorial Pattern Matching (Springer, Berlin, 1994) 64-74.
9. M.O. Dayhoff, R.M. Schwartz and B.C. Orcutt, A model of evolutionary change in proteins, in: M.O. Dayhoff, ed., Atlas of Protein Sequence an Structure, Vol. 5, Suppl. 3 (Natl. Biomed. Res. Found., 1978) 345-352.
10. O. Gascuel and A. Danchin, Protein export in prokaryotes and eukaryotes: indications of a difference in the mechanism of exportation, J. Mol. Evol. 24 (1986) 130-142.
11. D. Gusfield, Efficient method for multiple sequence alignment with guaranteed error bounds, Bull. of Math. Biol. 55 (1993) 141-154.
12. S. Henikoff, Comparative sequence analysis: finding genes, in: D.W. Smith, ed., Biocomputing. Informatics and Genome Projects (Academic Press, New York, 1994) 87-117.
13. S. Henikoff and J.G. Henikoff, Automated assembly of protein blocks for database searching, Nucl. Acids Res. 19 (1991) 6565-6572.
14. S. Karlin and G. Ghandour, Multiple alphabet amino acid sequence comparisons of the immunoglobulin κ-chain constant domain, Proc. Natl. Acad. Sci. USA 82 (1985) 8597-8601.
15. R.M. Karp, R.E. Miller and A.L. Rosenberg, Rapid identification of repeated patterns in strings, trees and arrays, Proc. 4th Annu. ACM Symp. Theory of Computing (1972) 125-136.
16. A. Landraud, J.F. Avril and P. Chretienne, An algorithm for finding a common structure shared by a family of strings, IEEE Trans. Pattern Anal. Mach. Intelligence 11 (1989) 890-895.
17. H.M. Martinez, A flexible multiple sequence alignment program, Nucleic Acids Res. 16 (1988) 1683-1691.
18. M.A. McClure, T.K., Vasi and W.M. Fitch, Comparative analysis of multiple protein-sequence alignment methods, Mol. Biol. Evol. 11 (1994) 571-592.
19. R.N. Pau, Nitrogenases without molybdenum, Trends Biochem. Sci. 14 (1989) 183-186.
20. J. Posfai, A.S. Bhagwat, G. Posfai and R.J. Roberts, Prediction motifs derived from cytosine methyltransferases, Nucl. Acids Res. 17 (1989) 2421-2435.
21. M.F. Sagot, V. Escalier, A. Viari and H. Soldano, Searching for repeated words in a text allowing for mismatches and gaps, Vinas del Mar, Chili, Second South American Workshop on String Processing, 1995.
22. M.F. Sagot, A. Viari, J. Pothier and H. Soldano, Finding flexible patterns in a text - An application to 3D molecular matching. Comput. Appl. Biosci. 11 (1995) 59-70.
23. D. Sankoff, Minimum mutation trees of sequences, SIAM J. Appl. Math. 28 (1975) 35-42.
24. D. Sankoff and R.J. Cedergreen, Simultaneous comparison of three or more sequences related by a tree, in: D. Sankoff and J.B. Kruskall, eds., Time Warps, String Edits and Macromolecules. The Theory and Practice of Sequence Comparison (Addison-Wesley, Reading, MA, 1983) 253-263.
25. G.D. Schuler, S.F. Altschul and D.J. Lipman, A workbench for multiple alignment construction and analysis, Proteins: Struct. Func. Genetics 9 (1991) 180-190.
26. H. Soldano, A. Viari and M. Champesme, Searching for flexible repeated patterns using a non transitive similarity relation, Pattern Recognition Lett. 16 (1995) 233-246.
27. W.R. Taylor, The classification of amino acid conservation, J. Theoret. Biol. 119 (1986) 205-218.
28. A. Viari and J. Pothier, SmartMulti: a tool for the multiple alignment of protein sequences using flexible blocks, Atelier de BioInformatique, 26, Rue d'Ulm-75005 Paris, 1996, in preparation.
29. M.S. Waterman, General methods of sequence comparison, Bull. Math. Biol. 46 (1984) 473-500.
30. M.S. Waterman, in: Introduction to Computational Biology. Maps, Sequences and Genomes (Chapman & Hall, London, 1995).