Multiple sequence comparison: A peptide matching approach
We present in this paper a peptide matching approach to the multiple comparison of a set of protein sequences. This approach consists in looking for all the words that are common to q of these sequences, where q is a parameter.
The comparison between words is done by using as reference an object called a model. In the case of proteins, a model is a product of subsets of the alphabet σ of the amino acids. These subsets belong to a cover of σ, that is, their union covers all of σ. A word is said to be an instance of a model if it belongs to the model.
A further flexibility is introduced in the comparison by allowing for up to e errors in the comparison between a word and a model. A word is said to be this time an occurrence of a model if the Levenshtein distance between it and an instance of the model is inferior or equal to e. Two words are said to be similar if there is at least one model of which both are occurrences. In the special case where e = 0, the occurrences of a model are simply its instances. If a model M has occurrences in at least q of the sequences of the set, M is said to occur in the set.
The algorithm presented here is an efficient and exact way of looking for all the models, of a fixed length k or of the greatest possible length k max , that occur in a set of sequences. It is linear in the total length n of the sequences and proportional to k2e+1 where k ≪ n is a small value in all practical situations.
Models are closely related to what is called a consensus in the biocomputing area, and covers are a good way of representing complex relationships between the amino acids.
keywordsmultiple comparison cover model edit distance
Unable to display preview. Download preview PDF.
- D.L. Brutlag, J-P. Dautricourt, S. Maulik, and J. Relph. Improved sensitivity of biological sequence database searches. Comput. Applic. Biosc., 6:237–245, 1990.Google Scholar
- H. Carrillo and D.J. Lipman. The multiple sequence alignment problem in biology. SIAM J. Appl. Math., 48:1073–1083, 1988.Google Scholar
- A.L. Cobbs. Fast identification of approximately matching substrings. In M. Crochemore and D. Gusfield, editors, Combinatorial Pattern Matching, pages 64–74. Springer Verlag, 1994.Google Scholar
- M.O. Dayhoff, R.M. Schwartz, and B.C. Orcutt. A model of evolutionary change in proteins. In M.O. Dayhoff, editor, Atlas of Protein Sequence an Structure, volume 5 suppl.3, pages 345–352. Natl. Biomed. Res. Found., 1978.Google Scholar
- D. Gusfield. Efficient method for multiple sequence alignment with guaranteed error bounds. Bull. of Math. Biol., 55:141–154, 1993.Google Scholar
- S. Henikoff. Comparative sequence analysis: finding genes. In D.W. Smith, editor, Biocomputing. Informatics and Genome Projects, pages 87–117. Academic Press, 1994.Google Scholar
- R.M. Karp, R.E. Miller, and A.L. Rosenberg. Rapid identification of repeated patterns in strings, trees and arrays. pages 125–136. Proc. 4th Annu. ACM Symp. Theory of Computing, 1972.Google Scholar
- A. Landraud, J.F. Avril, and P. Chretienne. An algorithm for finding a common structure shared by a family of strings. IEEE Trans. on Pattern Analysis and Machine Intelligence, 11:890–895, 1989.Google Scholar
- M. F. Sagot, A. Viari, J. Pothier, and H. Soldano. Finding flexible patterns in a text — an application to 3D molecular matching. pages 117–145, Seattle, Washington, USA, 1994. First International IEEE Workshop on Shape and Pattern Matching in Computational Biology.Google Scholar
- M.F. Sagot, V. Escalier, A. Viari, and H. Soldano. Searching for repeated words in a text allowing for mismatches and gaps. Viñas del Mar, Chili, 1994. Second South American Workshop on String Processing.Google Scholar
- D. Sankoff and R.J. Cedergreen. Simultaneous comparison of three or more sequences related by a tree. In D. Sankoff and J.B. Kruskall, editors, Time Warps, String Edits, and Macromolecules. The Theory and Practice of sequence Comparison, pages 253–263. Addison-Wesley, 1983.Google Scholar
- G.D. Schuler, S.F. Altschul, and D.J. Lipman. A workbench for multiple alignment construction and analysis. Proteins: Struct., Func., and Genetics, 9:180–190, 1991.Google Scholar
- H. Soldano, A. Viari, and M. Champesme. Searching for flexible repeated patterns using a non transitive similarity relation. Pattern Recognition Letters, 1994. in press.Google Scholar
- A. Viari and J. Pothier. SmartMulti: a tool for the multiple alignment of protein sequences using flexible blocks. Atelier de BioInformatique, 11, rue P. et M. Curie — 75005 Paris, 1994. in preparation.Google Scholar