{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:13:59Z","timestamp":1725542039952},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106309"},{"type":"electronic","value":"9783642106316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_72","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T07:03:43Z","timestamp":1259910223000},"page":"710-719","source":"Crossref","is-referenced-by-count":13,"title":["Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Bulteau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Fertin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irena","family":"Rusu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"72_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/3-540-62592-5_80","volume-title":"Algorithms and Complexity","author":"P. Alimonti","year":"1997","unstructured":"Alimonti, P., Kann, V.: Hardness of approximating problems on cubic graphs. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds.) CIAC 1997. LNCS, vol.\u00a01203, pp. 288\u2013298. Springer, Heidelberg (1997)"},{"issue":"1","key":"72_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703437843","volume":"36","author":"R. Bar-Yehuda","year":"2006","unstructured":"Bar-Yehuda, R., Halld\u00f3rsson, M.M., Naor, J., Shachnai, H., Shapira, I.: Scheduling split intervals. SIAM J. Comput.\u00a036(1), 1\u201315 (2006)","journal-title":"SIAM J. Comput."},{"key":"72_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-85097-7_30","volume-title":"Combinatorial Optimization and Applications","author":"Z. Chen","year":"2008","unstructured":"Chen, Z., Fu, B., Jiang, M., Zhu, B.: On recovering syntenic blocks from comparative maps. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol.\u00a05165, pp. 319\u2013327. Springer, Heidelberg (2008)"},{"key":"72_CR4","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-540-74126-8_26","volume-title":"Algorithms in Bioinformatics","author":"V. Choi","year":"2007","unstructured":"Choi, V., Zheng, C., Zhu, Q., Sankoff, D.: Algorithms for the extraction of synteny blocks from comparative maps. In: Giancarlo, R., Hannenhalli, S. (eds.) WABI 2007. LNCS (LNBI), vol.\u00a04645, pp. 277\u2013288. Springer, Heidelberg (2007)"},{"key":"72_CR5","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. Golumbic","year":"1980","unstructured":"Golumbic, M.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"issue":"3","key":"72_CR6","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"28","author":"G.J. Minty","year":"1980","unstructured":"Minty, G.J.: On maximal independent sets of vertices in claw-free graphs. J. Comb. Theory, Ser. B\u00a028(3), 284\u2013304 (1980)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"3","key":"72_CR7","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci.\u00a043(3), 425\u2013440 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"72_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1007\/978-3-642-02017-9_42","volume-title":"TAMC 2009","author":"L. Wang","year":"2009","unstructured":"Wang, L., Zhu, B.: On the tractability of maximal strip recovery. In: Chen, J., Cooper, S.B. (eds.) TAMC 2009. LNCS, vol.\u00a05532, pp. 400\u2013409. Springer, Heidelberg (2009)"},{"issue":"4","key":"72_CR9","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/TCBB.2007.1075","volume":"4","author":"C. Zheng","year":"2007","unstructured":"Zheng, C., Zhu, Q., Sankoff, D.: Removing noise and ambiguities from comparative maps in rearrangement analysis. IEEE\/ACM Trans. Comput. Biology Bioinform.\u00a04(4), 515\u2013522 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinform."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10631-6_72.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:36:58Z","timestamp":1619782618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}