{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:07Z","timestamp":1759638547186},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,11,13]],"date-time":"2010-11-13T00:00:00Z","timestamp":1289606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1007\/s10878-010-9366-y","type":"journal-article","created":{"date-parts":[[2010,11,12]],"date-time":"2010-11-12T14:50:01Z","timestamp":1289573401000},"page":"493-506","source":"Crossref","is-referenced-by-count":14,"title":["Exact and approximation algorithms for\u00a0the\u00a0complementary maximal strip recovery problem"],"prefix":"10.1007","volume":"23","author":[{"given":"Haitao","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,11,13]]},"reference":[{"key":"9366_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0097539703437843","volume":"36","author":"R Bar-Yehuda","year":"2006","unstructured":"Bar-Yehuda R, Halld\u00f3rsson MM, Naor JS, Shachnai H, Shapira I (2006) Scheduling split intervals. SIAM J Comput 36:1\u201315","journal-title":"SIAM J Comput"},{"key":"9366_CR2","series-title":"LNCS","first-page":"710","volume-title":"Proceedings of the 20th annual international symposium on algorithms and computation (ISAAC\u201909)","author":"L Bulteau","year":"2009","unstructured":"Bulteau L, Fertin G, Rusu I (2009) Maximal strip recovery problem with gaps: hardness and approximation algorithms. In: Proceedings of the 20th annual international symposium on algorithms and computation (ISAAC\u201909). LNCS, vol\u00a05878, pp\u00a0710\u2013719"},{"key":"9366_CR3","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10878-009-9233-x","volume":"18","author":"Z Chen","year":"2009","unstructured":"Chen Z, Fu B, Jiang M, Zhu B (2009) On recovering synthetic blocks from comparative maps. J\u00a0Combin Optim 18:307\u2013318","journal-title":"J\u00a0Combin Optim"},{"key":"9366_CR4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/978-3-540-74126-8_26","volume-title":"Proceedings of the 7th international workshop on algorithms in bioinformatics (WABI\u201907)","author":"V Choi","year":"2007","unstructured":"Choi V, Zheng C, Zhu Q, Sankoff D (2007) Algorithms for the extraction of synteny blocks from comparative maps. In: Proceedings of the 7th international workshop on algorithms in bioinformatics (WABI\u201907), pp\u00a0277\u2013288"},{"key":"9366_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"R Downey","year":"1999","unstructured":"Downey R, Fellows M (1999) Parameterized complexity. Springer, Berlin"},{"key":"9366_CR6","series-title":"LNCS","first-page":"616","volume-title":"Proceedings of the 20th annual international symposium on algorithms and computation (ISAAC\u201909)","author":"M Jiang","year":"2009","unstructured":"Jiang M (2009) Inapproximability of maximal strip recovery. In: Proceedings of the 20th annual international symposium on algorithms and computation (ISAAC\u201909). LNCS, vol\u00a05878, pp\u00a0616\u2013625"},{"key":"9366_CR7","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/978-3-642-14553-7_8","volume-title":"Proceedings of the 4th annual frontiers of algorithmics workshop (FAW\u201910)","author":"M Jiang","year":"2010","unstructured":"Jiang M (2010) Inapproximability of maximal strip recovery, II. In: Proceedings of the 4th annual frontiers of algorithmics workshop (FAW\u201910). LNCS, vol\u00a06213, pp\u00a053\u201364"},{"issue":"7","key":"9366_CR8","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1089\/cmb.2009.0084","volume":"17","author":"L Wang","year":"2010","unstructured":"Wang L, Zhu B (2010) On the tractability of maximal strip recovery. J\u00a0Comput Biol 17(7):907\u2013914 (A\u00a0one-page correction is to appear in January 2011)","journal-title":"J\u00a0Comput Biol"},{"key":"9366_CR9","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/TCBB.2007.1075","volume":"4","author":"C Zheng","year":"2007","unstructured":"Zheng C, Zhu Q, Sankoff D (2007) Removing noise and ambiguities from comparative maps in rearrangement analysis. IEEE\/ACM Trans Comput Biol Bioinform 4:515\u2013522","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9366-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9366-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9366-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:14Z","timestamp":1559276594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9366-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,13]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["9366"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9366-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,13]]}}}