Multiple sequence alignment with the divide-and-conquer method

Gene

Volumn 211, Issue 2, 1998, Pages

  Stoye, Jens ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

Divide and Conquer Alignment; Multiple sequence alignment

Indexed keywords

AMINO ACID; NUCLEIC ACID;

ALGORITHM; AMINO ACID SEQUENCE; ARTICLE; GENETIC PROCEDURES; NUCLEOTIDE SEQUENCE; PRIORITY JOURNAL; SEQUENCE HOMOLOGY; TECHNIQUE;

ALGORITHMS; COMPUTATIONAL BIOLOGY; GENETICS; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS; SEQUENCE HOMOLOGY; SOFTWARE;

EID: 0345676554     PISSN: 03781119     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0378-1119(98)00097-3     Document Type: Article

References (36)

1. Altschul S.F., Erickson B.W. Optimal sequence alignment using affine gap costs. Bull. Math. Biol. 48(5/6):1986;603-616.
2. Altschul S.F., Lipman D.J. Trees, stars, and multiple biological sequence alignment. SIAM J. Appl. Math. 49(1):1989;197-209.
3. Argos P., Vingron M., Vogt G. Protein sequence comparisons: Methods and significance. Prot. Eng. 4(4):1991;375-383.
4. Barton G.J., Sternberg M.J.E. A strategy for the rapid multiple alignment of protein sequences - confidence levels from tertiary structure comparisons. J. Mol. Biol. 198:1987;327-337.
5. Barton G.J., Sternberg M.J.E. Evaluation and improvements in the automatic alignment of protein sequences. Prot. Eng. 1(2):1987;89-94.
6. Ben-Dor, A., Lancia, G., Perone, J., Ravi, R., 1997. Banishing bias from consensus sequences. In: Apostolico, A., Hein, J. (Eds.), Combinatorial Pattern Matching: 8th Annual Symposium, CPM 97. Aarhus, Denmark, June/July 1997. Proc. No. 1264 in Lecture Notes in Computer Science. Springer, Berlin, pp. 247-261.
7. Bergmann, K., Dress, A., Stoye, J., Vingron, M., in preparation. A practical approach to integrated alignment and phylogeny construction.
8. Carrillo H., Lipman D. The multiple sequence alignment problem in biology. SIAM J. Appl. Math. 48(5):1988;1073-1082.
9. Chan S.C., Wong A.K.C., Chiu D.K.Y. A survey of multiple sequence comparison methods. Bull. Math. Biol. 54(4):1992;563-598.
10. Dayhoff, M.O., Schwartz, R.M., Orcutt, B.C., 1979. A model of evolutionary change in proteins. In Dayhoff, M.O. (Ed.), Atlas of Protein Sequence and Structure, Vol. 5, Suppl. 3. National Biomedical Research Foundation, Washington, DC, pp. 345-352.
11. Feng D.-F., Doolittle R.F. Progressive sequence alignment as a pre-requisite to correct phylogenetic trees. J. Mol. Evol. 25:1987;351-360.
12. Gotoh O. An improved algorithm for matching biological sequences. J. Mol. Biol. 162:1982;705-708.
13. Gotoh O. Significant improvement in accuracy of multiple protein sequence alignments by iterative refinement as assessed by reference to structural alignments. J. Mol. Biol. 264:1996;823-838.
14. Gupta S.K., Kececioglu J.D., Schäffer A.A. Improving the practical space and time efficiency of the shortest-paths approach to sum-of-pairs multiple sequence alignment. J. Comp. Biol. 2(3):1995;459-472.
15. Gusfield D. Efficient methods for multiple sequence alignment with guaranteed error bounds. Bull. Math. Biol. 55(1):1993;141-154.
16. Hein, J., 1994. TreeAlign. In: Griffin, A.M., Griffin, H.G. (Eds.), Computer Analysis of Sequence Data, Part II, Vol. 25 of Methods in Molecular Biology. Humana Press, Totowa, NJ, 1994, pp. 349-364.
17. Henikoff S., Henikoff J.G. Amino acid substitution matrices from protein blocks. Proc. Natl. Acad. Sci. USA. 89:1992;10915-10919.
18. Henikoff S., Henikoff J.G. Performance evaluation of amino acid substitution matrices. Proteins. 17:1993;49-61.
19. Lake J.A. The order of sequence alignment can bias the selection of tree topology. Mol. Biol. Evol. 8(3):1991;378-385.
20. Lipman D.J., Altschul S.F., Kececioglu J.D. A tool for multiple sequence alignment. Proc. Natl. Acad. Sci. USA. 86:1989;4412-4415.
21. McClure M.A., Vasi T.K., Fitch W.M. Comparative analysis of multiple protein-sequence alignment methods. Mol. Biol. Evol. 11(4):1994;571-592.
22. Morgenstern B., Dress A.W.M., Werner T. Multiple DNA and protein sequence alignment based on segment-to-segment comparison. Proc. Natl. Acad. Sci. USA. 93(22):1996;12098-12103.
23. Needleman S.B., Wunsch C.D. A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol. 48:1970;443-453.
24. Perrey, S.W., Stoye, J., Moulton, V., in preparation. Heuristic techniques for simultaneous multiple sequence alignment.
25. Pevzner, P.A., 1992. Multiple alignment with guaranteed error bounds and communication cost. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (Eds.), Combinational Pattern Matching: Third Annual Symposium, CPM 92. Tucson, AZ, April/May 1992. Proc. number 644 in Lecture Notes in Computer Science. Spring, Berlin, pp. 205-213.
26. Schuler G.D., Altschul S.F., Lipman D.J. A workbench for multiple alignment construction and analysis. Proteins. 9:1991;180-190.
27. Stoye, J., 1997. Divide-and-Conquer Multiple Sequence Alignment. Dissertation, Technische Fakultät der Universität Bielefeld. Available online from http://www.mathematik.uni-bielefeld.de/~stoye/preprints/report97-02.ps.gz.
28. Stoye J., Perrey S.W., Dress A.W.M. Improving the divide-and-conquer approach to sum-of-pairs multiple sequence alignment. Appl. Math. Lett. 10(2):1997;67-73.
29. Stoye J., Moulton V., Dress A.W.M. DCA: An efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment. CABIOS. 13(6):1997;625-626.
30. Stoye, J., Evers, D., Meyer, F., in press. Rose: Generating sequence families. Bioinformatics.
31. Thorn J.L., Kishino H. Freeing phylogenies from artifacts of alignment. Mol. Biol. Evol. 9(6):1992;1148-1162.
32. Tönges U., Peery S.W., Stoye J., Dress A.W.M. A general method for fast multiple sequence alignment. Gene. 172:1996;GC33-GC41.
33. Vingron M., Argos P. Determination of reliable regions in protein sequence alignments. Prot. Eng. 3(7):1990;565-569.
34. Vingron M., Argos P. Motif recognition and alignment for many sequences by comparison of dot-matrices. J. Mol. Biol. 218:1991;33-43.
35. Wang L., Jiang T. On the complexity of multiple sequence alignment. J. Comp. Biol. 1(4):1994;337-348.
36. Waterman M.S. Sequence alignments in the neighborhood of the optimum with general application to dynamic programming. Proc. Natl. Acad. Sci. USA. 80:1983;3123-3124.