Making the shortest-paths approach to Sum-of-Pairs multiple sequence alignment more space efficient in practice (Extended Abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 937, Issue , 1995, Pages 128-143

  Gupta, Sandeep K ^a,c   Kececioglu, John D ^b,d   Schäffer, Alejandro A ^a  

^a RICE UNIVERSITY   (United States)

^b UNIVERSITY OF GEORGIA   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3643075904     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60044-2_39     Document Type: Conference Paper

References (19)

1. S. F. Altschul. Gap costs for multiple sequence alignment. J. Theor. Biol., 138:297-309, 1989.
2. S. F. Altschul, Raymond J. Carroll, and David J. Lipman. Weights for data related by a tree. J. Molecular Biology, 207:647-653, 1989.
3. G. J. Barton and M. J. E. Sternberg. Evaluation and improvements in the automatic alignment of protein sequences. J. Mol. Biol., 198:327-337, 1987.
4. G. J. Barton and M. J. E. Sternberg. A strategy for the rapid multiple alignment of protein sequences. Protein Engineering, 1:89-94, 1987.
5. H. Bodlaender, R. G. Downey, M. R. Fellows, and H. T. Wareham. The parameterized complexity of sequence alignment and consensus. In Proc. of the 5th Syrup. on Combinatorial Pattern Matching, Lecture Notes Comp. Sci. 807, pages 15-30, 1994.
6. H. Carrillo and D. Lipman. The multiple sequence alignment problem in biology. SIAM J. Appl. Math., 48:1073-1082, 1988.
7. S. C. Chan, A. K. C. Wong, and D. K. Y. Chiu. A survey of multiple sequence comparison methods. Bulletin of Mathematical Biology, 54:563-598, 1992.
8. E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
9. D. Feng and R. Doolittle. Progressive sequence alignment as a prerequisite to correct phylogenetic trees. J. Molecular Evol., 25:351-360, 1987.
10. D. G. Higgins, A. J. Bleasby, and R. Fuchs. Clustal v: improved software for multiple sequence alignment. CABIOS, 8:189-191, 1992.
11. J. Kececioglu. Notes on an approach of Carrillo and Lipman to minimum sum of pairs multiple sequence alignment. Unpublished notes, 1989.
12. J. Kececioglu. The maximum weight trace problem in multiple sequence alignment. In Proc. of the 4th Symp. on Combinatorial Pattern Matching, Springer-Verlag Lecture Notes in Comp. Sci. 683, pages 106-119, 1993.
13. D. J. Lipman, S. F. Altschul, and J. D. Kececioglu. A tool for multiple sequence alignment. Proc. Natl. Acad. Sci. USA., 86:4412-4415, 1989.
14. D. Maier. The complexity of some problems on subsequences and supersequences. J. ACM, 25:322-336, 1978.
15. M. A. McClure, T. K. Vasi, and W. M. Fitch. Comparative analysis of multiple protein-sequeuce alignment methods. Mol. Biol. Evol., 11:571-592, 1994.
16. S. Subbiah and S. C. Harrison. A method for multiple sequence alignment with gaps. J. Mol. Biol., 209:539-548, 1989.
17. W. R. Taylor. Multiple sequence alignment by a pairwise algorithm. CABIOS, 3:81-87, 1987.
18. W. R. Taylor. A flexible method to align large numbers of biological sequences. Journal of Molecular Evolution, 28:161-169, 1988.
19. L. Wang and T. Jiang. On the complexity of multiple sequence alignment. J. Computational Biology, 1:337-348, 1994.