Non-approximability of weighted multiple sequence alignment

Theoretical Computer Science

Volumn 296, Issue 1, 2003, Pages 179-192

  Manthey, Bodo ^a  

^a UNIVERSITY OF LÜBECK   (Germany)

Author keywords

Computational biology; Multiple sequence alignment; Non approximability; SP score

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; POLYNOMIALS;

MULTIPLE SEQUENCE ALIGNMENT (MSA);

COMPUTER SCIENCE;

EID: 0037278174     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00439-5     Document Type: Conference Paper

References (17)

1. Akutsu T., Arimura H., Shimozono S. On approximation algorithms for local multiple alignment. Proc. 4th Ann. Internat. Conf. on Computational Molecular Biology (RECOMB). 2000;1-7 ACM, New York.
2. Arora S., Lund C., Motwani R., Sudan M., Szegedy M. Proof verification and the hardness of approximation problems. J. ACM. 45(3):1998;501-555.
3. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., Protasi M. Complexity and Approximation. Combinatorial Optimization Problems and Their Approximability Properties:1999;Springer, Berlin.
4. Bafna V., Lawler E.L., Pevzner P.A. Approximation algorithms for multiple sequence alignment. Theoret. Comput. Sci. 182(1-2):1997;233-244.
5. Bartal Y. On approximating arbitrary metrics by tree metrics. Proc. 30th Ann. Symp. on Theory of Computing (STOC). 1998;161-168 ACM, New York.
6. Bonizzoni P., Della Vedova G. The complexity of multiple sequence alignment with SP-score that is a metric. Theoret. Comput. Sci. 259(1):2001;63-79.
7. Carrillo H., Lipman D.J. The multiple sequence alignment problem in biology. SIAM J. Appl. Math. 48:1988;1073-1082.
8. Gusfield D.M. Efficient methods for multiple sequence alignment with guaranteed error bounds. Bull. Math. Biol. 55(1):1993;141-154.
9. Gusfield D.M. Algorithms on Strings, Trees, and Sequences. Computer Science and Computational Biology:1997;Cambridge University Press, Cambridge.
10. Hastad J. Some optimal inapproximability results. J. ACM. 48(4):2001;798-859.
11. Jiang T., Kearney P.E., Li M. Some open problems in computational molecular biology. J. Algorithms. 34(1):2000;194-201.
12. Just W. Computational complexity of multiple sequence alignment with SP-score. J. Comput. Biol. 8(6):2001;615-623.
13. Karp R.M. Mapping the genome. some combinatorial problems arising in molecular biology Proc. 25th Ann. Symp. on Theory of Computing (STOC). 1993;278-285 ACM, New York.
14. Papadimitriou C.H., Yannakakis M. Optimization, approximation, and complexity classes. J. Comput. System Sci. 43(3):1991;425-440.
15. Trevisan L., Sorkin G.B., Sudan M., Williamson D.P. Gadgets, approximation, and linear programming. SIAM J. Comput. 29(6):2000;2074-2097.
16. Wang L., Jiang T. On the complexity of multiple sequence alignment. J. Comput. Biol. 1(4):1994;337-348.
17. Wu B.Y., Lancia G., Bafna V., Chao K.-M., Ravi R., Tang C.Y. A polynomial-time approximation scheme for minimum routing cost spanning trees. SIAM J. Comput. 29(3):1999;761-778.