On incremental computation of transitive closure and greedy alignment

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

Volumn 1264, Issue , 1997, Pages 167-179

  Abdeddaïm, Saïd ^a  

^a UNIVERSITÉ LYON 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALIGNMENT; APPLICATION PROGRAMS; DIRECTED GRAPHS; PATTERN MATCHING;

ALIGNMENT ALGORITHMS; GREEDY ALGORITHMS; INCREMENTAL ALGORITHM; INCREMENTAL COMPUTATION; MULTIPLE ALIGNMENT; PAIRWISE LOCAL ALIGNMENT; SPANNING SETS; TRANSITIVE CLOSURE;

COMPUTATIONAL EFFICIENCY;

EID: 21744437040     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63220-4_58     Document Type: Conference Paper

References (22)

1. M. R. Garey and D. S. Johnson. Computers and intractability; a guide to the theory of NP-completeness. Freeman, 1979.
2. L. Wang and T. Jiang. On the complexity of multiple sequence alignment. J. Comput. Biol., 1:337-348, 1994.
3. T. Jiang, E. L. Lawler, and L. Wang. Aligning sequences via an evolutionary tree: complexity and approximation. In Proc. 26-th Annual ACM Syrup. Theory of Comput., pages 760-769, 1994.
4. P. Hogeweg and B. Hesper. The alignment of sets of sequences and the construction of phyletic trees: an integrated method. J. Mol. Evol., 20:175-186, 1984.
5. D-F. Feng and R. F. Doolittle. Progressive sequence alignment as a prerequisite to correct phylogenetic trees. J. Mol. Evol., 25:351-360, 1987.
6. W. R. Taylor. Protein structure prediction. In M. J. Bishop and C. J. Rawlings, editors, Nucleic Acid and Protein Sequence Analysis, a Practical Approach., pages 285-323. IRL Press, 1987.
7. F. Corpet. Multiple sequence alignment with hierarchial clustering. Nucleic Acids Research, 16(22): 10881-10890, 1988.
8. D.G. Higgins and P.M. Sharp. Fast and sensitive multiple sequence alignments on a microcomputer. CABIOS, 5:151-153, 1989.
9. O. Gotoh. Further improvement in methods of group-to-group sequence alignment with generalized profile operations. CABIOS, 10(4):379-387, 1994.
10. A. M. Landraud, J. F. Avril, and P. Chrétienne. An algorithm for finding a common structure shared by a family of strings. IEEE Transactions on Pattern Analysis and Machine Intelligence, 11:890-895, 1989.
11. Saïd Abdeddaïm. Fast and sound two-step algorithms for multiple alignment of nucleic sequences. In Proceedings of the IEEE International Joint Symposia on Intelligence and Systems, pages 4-11, 1996.
12. T. Ibaraki and N. Katoh. On-line computation of transitive closure for graphs. Inform. Proc. Lett., 16:95-97, 1983.
13. G. F. Italiano. Amortized efficiency of a path retrieval data structure. Theor. Comput. Sci., 48:273-281, 1986.
14. J. A. La Poutré and J. van Leeuwen. Maintenance of transitive closure and transitive reduction of graphs. In Proc. Workshop on Graph-Theoretic Concepts in Computer Science, pages 106-120. Lecture Notes in Computer Science 314, Springer- Verlag, 1988.
15. J. D. Thompson, D. G. Higgins, and T. J. Gibson. CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position specific gap penalties and weight matrix choice. Nucleic Acids Research, 22:4673-4680, 1994.
16. F. Mattern. Virtual time and global states of distributed systems. In Proc. Workshop on Parallel and Distributed Algorithms, pages 215-226, 1989.
17. C. J. Fidge. Timestamps in message-passing systems that preserve the partial ordering. In 11-th Australian Computer Science Conference, pages 55-66, 1988.
18. J. Kececioglu. The maximum weight trace problem in multiple sequence alignment. In 4-th Annual Syrup. Combinatorial Pattern Matching, volume 684 of LNCS, pages 106-119. 1993.
19. S. F. Altschul. Gap costs for multiple sequence alignment. J. Theor. Biol., 138:297-309, 1989.
20. T.F. Smith and M. S. Waterman. Identification of common molecular subsequences. J. Mol. Biol., 147:195-197, 1981.
21. T. K. Attwood, M. E. Beck, A. J. Bleasby, and D. J. Parry-Smith. PRINTS - a database of protein motif fingeprints. Nucleic Acids Research, 22:3590-3596, 1994.
22. M. S. Waterman. Mathematical Methods for DNA Sequences. C.R.C. Press, 1989.