Settling the intractability of multiple alignment

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

Volumn 2906, Issue , 2003, Pages 352-363

  Elias, Isaac ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; BIOINFORMATICS; BIOLOGY;

COMPUTATIONAL BIOLOGY; CONSENSUS PATTERNS; FOLLOWING PROBLEM; MULTIPLE ALIGNMENT; NP-HARDNESS RESULTS; STAR ALIGNMENTS; SUBSTRING; TREE ALIGNMENT;

ALIGNMENT;

EID: 35248849795     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24587-2_37     Document Type: Article

References (14)

1. L. Wang and T. Jiang. On the complexity of multiple sequence alignment. J. Comput. Bio., 1:337-348, 1994.
2. P. Bonizzoni and G. D. Vedova. The complexity of multiple sequence alignment with SP-score that is a metric. TCS, 259(1-2):63-79, 2001.
3. W. Just. Computational complexity of multiple sequence alignment with sp-score. Journal of Computational Biology, 8(6):615-623, 2001.
4. M. Li, B. Ma, and L. Wang. Finding similar regions in many strings. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing (STOC'99), pages 473-482, New York, May 1999. Association for Computing Machinery.
5. J. S. Sim and K. Park. The consensus string problem for a metric is np-complete. Journal of Discrete Algorithms, 2(1), 2001.
6. L. Wang, T. Jiang, and E. L. Lawler. Approximation algorithms for tree alignment with a given phylogeny. Algorithmica, 16(3):302-315, September 1996.
7. L. Wang, T. Jiang, and D. Gusfield. A more efficient approximation scheme for tree alignment. SIAM Journal on Computing, 30(1):283-299, February 2001.
8. M. Li, B. Ma, and L. Wang. Finding similar regions in many sequences, accepted by Journal of Computer and System Sciences, July 2001.
9. M. Blanchette, B. Schwikowski, and M. Tompa. Algorithms for phylogenetic footprinting. J. Comput. Bio., 9(2):211-223, 2002.
10. T. Akutsu. Hardness results on gapless local multiple sequence alignment. Technical Report 98-MPS-24-2, 1998.
11. M. Fellows, J. Gramm, and R. Niedermeier. On the parameterized intractability of CLOSEST SUBSTRING and related problems. In STACS, 2002.
12. I. Elias. Settling the intractability of multiple alignment. Technical Report TRITANA-0316, Nada, KTH, 2003.
13. C. H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43(3):425-440, 1991.
14. P. Berman and T. Fujito. On approximation properties of the independent set problem in degree 3 graphs. Lecture Notes in Computer Science, 955:449ff, 1995.