A memory-efficient algorithm for multiple sequence alignment with constraints

Bioinformatics

Volumn 21, Issue 1, 2005, Pages 20-30

  Lu, Chin Lung ^a   Huang, Yen Pin ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

NUCLEOTIDE;

ALGORITHM; ARTICLE; COMPUTER PROGRAM; CONSENSUS SEQUENCE; GENE FUNCTION; GENE STRUCTURE; GENETIC CONSERVATION; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; PRIORITY JOURNAL; PROTEIN MOTIF; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS;

EID: 12744260157     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/bth468     Document Type: Article

References (44)

1. Bafna,V., Lawler,E.L. and Pevzner,P.A. (1997) Approximation algorithms for multiple sequence alignment. Theoret. Comput. Sci., 182, 233-244.
2. Bonizzoni,P. and Vedova,G.D. (2001) The complexity of multiple sequence alignment with SP-score that is a metric. Theoret. Comput. Sci., 259, 63-79.
3. Carrillo,H. and Lipman,D. (1988) The multiple sequence alignment problem in biology. SIAM J. Appl. Math., 48, 1073-1082.
4. Chan,S.C., Wong,A.K.C. and Chiu,D.K.Y. (1992) A survey of multiple sequence comparison methods. Bull. Math. Biol., 54, 563-598.
5. Chao,K.M., Hardison,R.C. and Miller,W. (1994) Recent developments in linear-space alignment methods: a survey. J. Comput. Biol., 1, 271-291.
6. Chin,F.Y.L., Ho,N.L., Lamy,T.W., Wong,P.W.H. and Chan,M.Y. (2003) Efficient constrained multiple sequence alignment with performance guarantee. In Proceedings of the IEEE Computer Society Bioinformatics Conference (CSB 2003). IEEE, Los Alamitos, CA, pp. 337-346.
7. Corpet,F. (1988) Multiple sequence alignment with hierarchical clustering. Nucleic Acids Res., 16, 10881-10890.
8. Deiman,B. and Pleij,C.W.A. (1997) Pseudoknots: a vital feature in viral RNA. Semin. Virol., 8, 166-175.
9. Depiereux,E. and Feytmans,E. (1992) MATCH-BOX: a fundamentally new algorithm for the simultaneous alignment of several protein sequences. Comput. Appl. Biosci., 8, 501-509.
10. Feng,D.F. and Doolittle,R.F. (1987) Progressive sequence alignment as a prerequisite to correct phylogenetic trees. J. Mol. Evol., 25, 351-360.
11. Gusfield,D. (1993) Efficient methods for multiple sequence alignment with guaranteed error bounds. Bull. Math. Biol., 55 141-154.
12. Gusfield,D. (1997) Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, NY.
13. Higgins,D. and Sharpe,P. (1988) CLUSTAL: a package for performing multiple sequence alignment on a microcomputer. Gene, 73, 237-244.
14. Hirschberg,D.S. (1975) A linear space algorithm for computing maximal common subsequences. Commun. ACM, 18, 341-343.
15. Ikeda,T. and Imai,H. (1994) Fast A* algorithms for multiple sequence alignment. In Proceedings of the Genome Informatics Workshop Universal Academy Press, Tokyo, pp. 90-99.
16. Ikeda,T. and Imai,H. (1999) Enhanced A* algorithms for multiple alignments: optimal alignments for several sequences and k opt approximate alignments for large cases. Theoret. Comput. Sci. 210, 341-374.
17. Kececioglu,J.D. (1993) The maximum weight trace problem in multiple sequence alignment. In Proceedings of the Fourth Annual Symposium on Combinatorial Pattern Matching (CPM 2004), LNCS 684 Springer-Verlag, Heidelberg, Germany, pp. 106-119.
18. Kobayashi,H. and Imai,H. (1999) Improvement of the A* algorithm for multiple sequence alignment. In Proceedings of the Genome Informatics Workshop. Universal Academy Press, Tokyo, pp. 120-130.
19. Lermen,M. and Reinert,K. (2000) The practical use of the A* algorithm for exact multiple sequence alignment. J. Comput. Biol., 7, 655-672.
20. Li,M., Ma,B. and Wang,L. (2000) Near optimal multiple alignment within a band in polynomial time. In Proceedings of the Thirty Second Annual ACM Symposium on Theory of Computing (STOC 2000 . ACM Press, Portland, OR, pp. 425-434.
21. McClure,M.A., Vasi,T.K. and Fitch,W.M. (1994) Comparative analysis of multiple protein-sequence alignment methods. Mol. Biol. Evol., 11, 571-592.
22. Morgenstern,B. (1999) DIALIGN 2: improvement of the segment-to-segment approach to multiple sequence alignment. Bioinformatics, 15, 211-218.
23. Myers,E.W. and Miller,W. (1988) Optimal alignment in linear space. Comput. Appl. Biosci., 4, 11-17.
24. Myers,G., Selznick,S., Zhang,Z. and Miller,W. (1996) Progressive multiple alignment with constraints. J. Comput. Biol., 3, 563-572.
25. Nicholas,H.B., Ropelewski,A.J. and Deerfield,D.W. (2002) Strategies for multiple sequence alignment. Biotechniques, 32 592-603.
26. Notredame,C. (2002) Recent progresses in multiple sequence alignment: a survey. Pharmacogenomics, 3, 131-144.
27. Notredame,C., Higgins,D.G. and Heringa,J. (2000) T-Coffee: a novel method for fast and accurate multiple sequence alignment. J. Mol. Biol., 302, 205-217.
28. Pevzner,P.A. (1992) Multiple alignment, communication cost, and graph matching. SIAM J. Appl. Math., 52, 1763-1779.
29. Pleij,C.W.A. (1994) RNA pseudoknots. Curr. Opin. Struct. Biol., 4, 337-344.
30. Sammeth,M., Morgenstern,B. and Stoye,J. (2003) Divide-and-conquer multiple alignment with segment-based constraints. Bioinformatics, 19 (Suppl. 2), ii189-ii195.
31. Schuler,G.D., Altschul,S.F. and Lipman,D.J. (1991) A workbench for multiple alignment construction and analysis. Proteins 9, 180-190.
32. Stoye,J. (1998) Multiple sequence alignment with the divide-and-conquer method. Gene, 211, GC45-GC56.
33. Stoye,J., Moulton,V. and Dress,A.W.M. (1997a) DCA: an efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment. Comput. Appl. Biosci., 13, 625-626.
34. Stoye,J., Perrey,S.W. and Dress,A.W.M. (1997b) Improving the divide-and-conquer approach to sum-of-pairs multiple sequence alignment. Appl. Math. Lett., 10, 67-73.
35. Tang,C.Y., Lu,C.L., Chang,M.D.T., Tsai,Y.T., Sun,Y.J., Chao,K.M., Chang,J.M., Chiou,Y.H., Wu,C.M., Chang,H.T. and Chou,W.I. (2003) Constrained multiple sequence alignment tool development and its application to RNase family alignment. J. Bioinform. Comput. Biol., 1, 267-287.
36. Taylor,W.R. (1987) Multiple sequence alignment by a pairwise algorithm. Comput. Appl. Biosci., 3, 81-87.
37. Taylor,W.R. (1994) Motif-biased protein sequence alignment. J. Comput. Biol., 1, 297-310.
38. Thompson,J.D., Higgs,D.G. and Gibson,T.J. (1994) CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position specific gap penalties, and weight matrix choice. Nucleic Acids Res., 22, 4673-4680.
39. Thompson,J.D., Plewniak,F., Thierry,J.-C. and Poch,O. (2000) DbClustal: rapid and reliable global multiple alignments of protein sequences detected by database searches. Nucleic Acids Res., 28 2919-2926.
40. Tönges,U., Perrey,S.W., Stoye,J. and Dress,A.W.M. (1996) A general method for fast multiple sequence alignment. Gene, 172 GC33-GC41.
41. Tsai,Y.T., Huang,Y.P., Yu,C.T. and Lu,C.L. (2004) MuSiC: a tool for multiple sequence alignment with constraints. Bioinformatics (in press).
42. Wang,L. and Jiang,T. (1994) On the complexity of multiple sequence alignment. J. Comput. Biol., 1, 337-348.
43. Williams,G.D., Chang,R.-Y. and Brian,D.A. (1999) A phylogenetically conserved hairpin-type 39 untranslated region pseudoknot functions in coronavirus RNA replication. J. Virol., 73, 8349-8355.
44. Yu,C.T. (2003) Efficient algorithms for constrained sequence alignment problems. Master's Thesis, Department of Computer Science and Information Management, Providence University.