{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:26:47Z","timestamp":1742387207939},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3791,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0304-3975(02)00439-5","type":"journal-article","created":{"date-parts":[[2003,2,12]],"date-time":"2003-02-12T17:35:20Z","timestamp":1045071320000},"page":"179-192","source":"Crossref","is-referenced-by-count":6,"title":["Non-approximability of weighted multiple sequence alignment"],"prefix":"10.1016","volume":"296","author":[{"given":"Bodo","family":"Manthey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00439-5_BIB1","series-title":"Proc. 4th Ann. Internat. Conf. on Computational Molecular Biology (RECOMB)","first-page":"1","article-title":"On approximation algorithms for local multiple alignment","author":"Akutsu","year":"2000"},{"issue":"3","key":"10.1016\/S0304-3975(02)00439-5_BIB2","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/278298.278306","article-title":"Proof verification and the hardness of approximation problems","volume":"45","author":"Arora","year":"1998","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(02)00439-5_BIB3","series-title":"Complexity and Approximation","author":"Ausiello","year":"1999"},{"issue":"1\u20132","key":"10.1016\/S0304-3975(02)00439-5_BIB4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/S0304-3975(97)00023-6","article-title":"Approximation algorithms for multiple sequence alignment","volume":"182","author":"Bafna","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00439-5_BIB5","series-title":"Proc. 30th Ann. Symp. on Theory of Computing (STOC)","first-page":"161","article-title":"On approximating arbitrary metrics by tree metrics","author":"Bartal","year":"1998"},{"issue":"1","key":"10.1016\/S0304-3975(02)00439-5_BIB6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0304-3975(99)00324-2","article-title":"The complexity of multiple sequence alignment with SP-score that is a metric","volume":"259","author":"Bonizzoni","year":"2001","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00439-5_BIB7","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1137\/0148063","article-title":"The multiple sequence alignment problem in biology","volume":"48","author":"Carrillo","year":"1988","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"10.1016\/S0304-3975(02)00439-5_BIB8","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02460299","article-title":"Efficient methods for multiple sequence alignment with guaranteed error bounds","volume":"55","author":"Gusfield","year":"1993","journal-title":"Bull. Math. Biol."},{"key":"10.1016\/S0304-3975(02)00439-5_BIB9","series-title":"Algorithms on Strings, Trees, and Sequences","author":"Gusfield","year":"1997"},{"issue":"4","key":"10.1016\/S0304-3975(02)00439-5_BIB10","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1145\/502090.502098","article-title":"Some optimal inapproximability results","volume":"48","author":"H\u00e5stad","year":"2001","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/S0304-3975(02)00439-5_BIB11","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1006\/jagm.1999.1050","article-title":"Some open problems in computational molecular biology","volume":"34","author":"Jiang","year":"2000","journal-title":"J. Algorithms"},{"issue":"6","key":"10.1016\/S0304-3975(02)00439-5_BIB12","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1089\/106652701753307511","article-title":"Computational complexity of multiple sequence alignment with SP-score","volume":"8","author":"Just","year":"2001","journal-title":"J. Comput. Biol."},{"key":"10.1016\/S0304-3975(02)00439-5_BIB13","series-title":"Proc. 25th Ann. Symp. on Theory of Computing (STOC)","first-page":"278","article-title":"Mapping the genome","author":"Karp","year":"1993"},{"issue":"3","key":"10.1016\/S0304-3975(02)00439-5_BIB14","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation, and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. System Sci."},{"issue":"6","key":"10.1016\/S0304-3975(02)00439-5_BIB15","doi-asserted-by":"crossref","first-page":"2074","DOI":"10.1137\/S0097539797328847","article-title":"Gadgets, approximation, and linear programming","volume":"29","author":"Trevisan","year":"2000","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/S0304-3975(02)00439-5_BIB16","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1089\/cmb.1994.1.337","article-title":"On the complexity of multiple sequence alignment","volume":"1","author":"Wang","year":"1994","journal-title":"J. Comput. Biol."},{"issue":"3","key":"10.1016\/S0304-3975(02)00439-5_BIB17","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1137\/S009753979732253X","article-title":"A polynomial-time approximation scheme for minimum routing cost spanning trees","volume":"29","author":"Wu","year":"1999","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004395?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004395?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T04:27:16Z","timestamp":1553920036000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502004395"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0304397502004395"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00439-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}