Settling the intractability of multiple alignment

Journal of Computational Biology

Volumn 13, Issue 7, 2006, Pages 1323-1339

  Elias, Isaac ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Consensus patterns; Multiple alignment; NP hard; SP score; Star alignment; Substring parsimony; Tree alignment

Indexed keywords

ARTICLE; CONSENSUS SEQUENCE; GENETIC ALGORITHM; MATHEMATICAL ANALYSIS; MATHEMATICAL GENETICS; MATHEMATICAL PARAMETERS; METRIC SYSTEM; MULTIPLE ALIGNMENT; NP HARDNESS; PARSIMONY ANALYSIS; PHYLOGENETIC TREE; PRIORITY JOURNAL; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS; SP SCORE; STAR ALIGNMENT; TREE ALIGNMENT;

BASE SEQUENCE; COMPUTATIONAL BIOLOGY; SEQUENCE ALIGNMENT;

EID: 33846197539     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2006.13.1323     Document Type: Article

References (13)

1. Akutsu, T. 1998. Hardness results on gapless local multiple sequence alignment. Technical report 98-MPS-24-2.
2. Blanchette, M., Schwikowski, B., and Tompa, M. 2002. Algorithms for phylogenetic footprinting. J. Comput. Biol. 9, 211-223.
3. 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.
4. Buhler, J., and Tompa, M. 2002. Finding motifs using random projections. J. Comput. Biol. 9, 225-242.
5. Elias, I. 2003. Settling the intractability of multiple alignment. Technical report TRITA-NA-0316. Nada, KTH.
6. Fellows, M., Gramm, J., and Niedermeier, R. 2002. On the parameterized intractability of CLOSEST SUBSTRING and related problems. Proc. 19th STACS 2285, 262-273.
7. Just, W. 2001. Computational complexity of multiple sequence alignment with sp-score. J. Comput. Biol. 8, 615-623.
8. Li, M., Ma, B., and Wang, L. 1999. Finding similar regions in many strings. Proc. 31st Annu. ACM Symp. Theory Comput. 473-482.
9. Pevzner, P.A. and Sze, S. 2000. Combinatorial approaches to finding subtle signals in DNA sequences. Annu. Mtg. Int. Soc. Comput. Biol. (ISMB) 269-278.
10. Sim, J.S., and Park, K. 1999. The consensus string problem for a metric is np-complete. Proc. 10th Austra. Workshop Combinat. Algorithms 107-113.
11. Wang, L., and Jiang, T. 1994. On the complexity of multiple sequence alignment. J. Comput. Biol. 1, 337-348.
12. Wang, L., Jiang, T., and Gusfield, D. 2001. A more efficient approximation scheme for tree alignment. SIAM J. Comput. 30, 283-299.
13. Wang, L., Jiang, T., and Lawler, E.L. 1996. Approximation algorithms for tree alignment with a given phylogeny. Algorithmica 16, 302-315.