{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:01:24Z","timestamp":1725544884491},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424949"},{"type":"electronic","value":"9783540446798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44679-6_9","type":"book-chapter","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T17:00:37Z","timestamp":1265734837000},"page":"75-85","source":"Crossref","is-referenced-by-count":0,"title":["Non-approximability of Weighted Multiple Sequence Alignment"],"prefix":"10.1007","author":[{"given":"Bodo","family":"Siebert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,31]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"T. Akutsu, H. Arimura, and S. Shimozono On approximation algorithms for local multiple alignment. In Proc. 4th Ann. ACM Int. Conf. on Comput. Mol. Biol., pages 1\u20137, 2000.","key":"9_CR1","DOI":"10.1145\/332306.332311"},{"issue":"3","key":"9_CR2","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy Proof verification and the hardness of approximation problems. J. ACM, 45(3):501\u2013555, 1998.","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi Complexity and Approximation. Springer-Verlag, 1999.","key":"9_CR3","DOI":"10.1007\/978-3-642-58412-1"},{"issue":"1-2","key":"9_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0304-3975(97)00023-6","volume":"182","author":"V. Bafna","year":"1997","unstructured":"V. Bafna, E.L. Lawler, and P.A. Pevzner Approximation algorithms for multiple sequence alignment. Theor. Comp. Sc., 182(1-2):233\u2013244, 1997.","journal-title":"Theor. Comp. Sc"},{"doi-asserted-by":"crossref","unstructured":"Yair Bartal On approximating arbitrary metrics by tree metrics. In Proc. 30th Ann. Symp. Theor. Comput., pages 161\u2013168. ACM, 1998.","key":"9_CR5","DOI":"10.1145\/276698.276725"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1137\/0148063","volume":"48","author":"H. Carrillo","year":"1988","unstructured":"H. Carrillo and D. Lipman The multiple sequence alignment problem in biology. SIAM J. Appl. Math., 48:1073\u20131082, 1988.","journal-title":"SIAM J. Appl. Math"},{"doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad Some optimal inapproximability results. In Proc. 29th Ann. Symp. Theor. Comput., pages 1\u201310. ACM, 1997.","key":"9_CR7","DOI":"10.1145\/258533.258536"},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/333623.333626","volume":"30","author":"T. Jiang","year":"1999","unstructured":"T. Jiang, P. Kearney, and M. Li Some open problems in computational molecular biology. SIGACT News, 30(3):43\u201349, 1999.","journal-title":"SIGACT News"},{"unstructured":"W. Just Computational complexity of multiple sequence alignment with SP-score. Technical report, Ohio University, 1999.","key":"9_CR9"},{"issue":"3","key":"9_CR10","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"C.H. Papadimitriou and M. Yannakakis Optimization, approximation, and complexity classes. J. Comp. Sys. Sc., 43(3):425\u2013440, 1991.","journal-title":"J. Comp. Sys. Sc"},{"issue":"6","key":"9_CR11","doi-asserted-by":"publisher","first-page":"2074","DOI":"10.1137\/S0097539797328847","volume":"29","author":"L. Trevisan","year":"2000","unstructured":"L. Trevisan, G.B. Sorkin, M. Sudan, and D.P. Williamson Gadgets, approximation, and linear programming. SIAM J. Comput., 29(6):2074\u20132097, 2000.","journal-title":"SIAM J. Comput"},{"issue":"4","key":"9_CR12","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1089\/cmb.1994.1.337","volume":"1","author":"L. Wang","year":"1994","unstructured":"L. Wang and T. Jiang On the complexity of multiple sequence alignment. J. Comp. Biol., 1(4):337\u2013348, 1994.","journal-title":"J. Comp. Biol"},{"issue":"3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1137\/S009753979732253X","volume":"29","author":"B.Y. Wu","year":"1999","unstructured":"B.Y. Wu, G. Lancia, V. Bafna, K. Chao, R. Ravi, and C.Y. Tang A polynomialtime approximation scheme for minimum routing cost spanning trees. SIAM J. Comput., 29(3):761\u2013778, 1999.","journal-title":"SIAM J. Comput"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44679-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T21:33:20Z","timestamp":1558820000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44679-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424949","9783540446798"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44679-6_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}