Fast and sound two-step algorithms for multiple alignment of nucleic sequences

IEEE International Joint Symposia on Intelligence and Systems

Volumn , Issue , 1996, Pages 4-11

  Abdeddaim, Said ^a  

^a SORBONNE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL SEQUENCES;

ALGORITHMS; HEURISTIC METHODS;

DNA SEQUENCES;

EID: 0030398559     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (37)

1. S. Abdeddaim. Comparaison de sequences biologiques. These de Doctoratde I'universite Paris VI, 1996.
2. S. F. Altschul. Gap costs for multiple sequence alignment. J. Theor.Bioi, 138:297-309, 1989.
3. S. F. Altschul and D. J. Lipman. Trees, stars and multiple biological sequence alignment. SIAM J. Appl. Math., 49:197-209,1989.
4. H. Carrillo and D. Lipman. The multiple sequence alignment problem in biology. SIAM J. Appl. Math., 48:1073-1082, 1988.
5. F. Corpet. Multiple sequence alignment with hierarchial clustering. Nucleic Acids Research, 16:10881-10890,1988.
6. D. Eppstein, Z. Galil, R. Giancarlo, and G. F. Italiano. Sparse dynamic programming I: linear cost functions. Journal of the ACM, 39:519-545,1992.
7. D.-F. Feng and R. F. Doolittle. Progressive sequence align-ment as a prerequisite to correct phylogenetic trees. J. Mol. Evol, 25:351-360,1987.
8. C. J. Fidge. Timestamps in message-passing systems that preserve the partial ordering. In 11-th Australian Computer Science Conference, pages 55-66, 1988.
9. M. R. Garey and D. S. Johnson. Computers and intractabil-ity; a guide to the theory of NP-completeness. Freeman, 1979.
10. O. Gotoh. Alignment of three biological sequences with an efficient traceback procedure. J. Theor.Biol., 121:327-337, 1986.
11. O. Gotoh. Optimal alignment between groups of sequences and its application to multiple sequence alignment. CABIOS, 9:361-370,1993.
12. O. Gotoh. Further improvement in methods of group-to-group sequence alignment with generalized profile operations. CABIOS, 10:379-387,1994.
13. J.Hein. A new method that simultaneously aligns and reconstructs ancestral sequences for any number of homologous sequences, when the phytogeny is given. Molecular Biology and Evolution., 6:649-668,1989.
14. J. Hein. Unified approach to alignment and phytogenies. Methods in Enzymology, 183:626-645,1990.
15. J. Hein. Treealign. Methods in Molecular Biology, V25: Computer Analaysis ofSequence Data, Part II., 25:349-364, 1994.
16. D. Higgins and P. Sharp. Fast and sensitive multiple se-quence alignments on a microcomputer. CABIOS, 5:151-153, 1989.
17. P. Hogeweg and B. Hesper. The alignment of sets of se-quences and the construction of phyletic trees: an integrated method. J. Mol. Evol, 20:175-186,1984.
18. G. F. Italiano. Amortized efficiency of a path retrieval data structure. Theor. Comput. Set, 48:273-281,1986.
19. T. Jiang, E. L. Lawler, and L. Wang. Aligning sequences via an evolutionary tree: complexity and approximation. In Proc. 26-th Annual ACM Symp. Theory of Comput., pages 760-769,1994.
20. S. Karlin, F. Ost, and E. Blaisdell. Patterns in dna and amino acid sequences and their statistical signifiance. In M. Waterman, editor, Mathematical Methods for DNA Sequences. CRC Press, 1989.
21. R. M. Karp, R. E. Miller, and A. L. Rosenberg. Rapid identification of repeated patterns in strings, trees, and arrays. In Proc. Fourth ACM Symp. on Theory of Computing, pages 125-136,1972.
22. J. A. La PoutaS and J. van Leeuwen. Maintenance of tran-sitive closure and transitive reduction of graphs. In Proc. Workshop on Graph-Theoretic Concepts in Computer Sci-ence, pages 106-120. Lecture Notes in Computer Science 314, Springer-Verlag, 1988.
23. L. Lamport. Time, clocks and the ordering of events in a distributed system. Comm. of the ACM, 21:558-565,1978.
24. A. M. Landraud, J. F. Avril, and P. Chretienne. An algorithm for finding a common structure shared by a family of strings. IEEE Transactions on Pattern Analysis and Machine Intel-ligence, 11:890-895,1989.
25. H. M. Martinez. A flexible multiple sequence alignment program. Nucleic Acids Research, 16:1683-1692,1988.
26. F. Mattern. Virtual time and global states of distributed systems. In Proc. Workshop on Parallel and Distributed Algorithms, pages 215-226,1989.
27. M. Murata, J. S. Richardson, and J. L. Sussman. Simulta-neous comparison of three protein sequences. Proc. Natl. Acad. Sci. (USA), 82:3073-3077,1985.
28. E. Myers. Chaining multiple-alignment fragments in sub-quadratic time. In Proc. 6-th Annual ACM-SIAM Symp. Discr. Algorithms, pages 38-47,1995.
29. S. B. Needleman and C. D. Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol, 48:443-453,1970.
30. R.F.Smith and T.F.Smith. Automatic generation of primary sequence patterns from sets of related protein sequences. In Proc. Natl. Acad. Sci., volume 87, pages 118-122,1990.
31. E. Sobel and H. M. Martinez. A multiple sequence alignment program. Nucleic Acids Research, 14:363-374, 1986.
32. S. Subbiah and S. C. Harrison. A method for multiple se-quence alignment with gaps. Journal of Molecular Biology, 209:539-548,1989.
33. W. R. Taylor. A flexible method to align large numbers of biological sequences. J. Mol. Evol, 28:161-169,1988.
34. J. D. Thompson, D. G. Higgins, and T. J. Gibson. CLUSTAL W: improving the sensitivity of progressive mul-tiple sequence alignment through sequence weighting, posi-tion specific gap penalties and weight matrix choice. Nucleic Acids Research, 22:4673-4680,1994.
35. L. Wang and T. Jiang. On the complexity of multiple se-quence alignment. J. Comput. Biol., 1:337-348, 1994.
36. W. J. Wilbur and D. J. Lipman. The context dependent comparison of biological sequences. SIAM J. Appl. Math., 44:556-567,1984.
37. D. M. Yellin. Speeding up dynamic transitive closure for bounded degree graphs. Acta Informatica, 30:369-384, 1993.