{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:36:29Z","timestamp":1725892589594},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212031"},{"type":"electronic","value":"9783642212048"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21204-8_9","type":"book-chapter","created":{"date-parts":[[2011,5,28]],"date-time":"2011-05-28T05:15:25Z","timestamp":1306559725000},"page":"46-57","source":"Crossref","is-referenced-by-count":2,"title":["An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery Problem"],"prefix":"10.1007","author":[{"given":"Zhong","family":"Li","sequence":"first","affiliation":[]},{"given":"Randy","family":"Goebel","sequence":"additional","affiliation":[]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","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.S., Shachnai, H., Shapira, I.: Scheduling split intervals. SIAM Journal on Computing\u00a036, 1\u201315 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1007\/978-3-642-10631-6_72","volume-title":"Algorithms and Computation","author":"L. Bulteau","year":"2009","unstructured":"Bulteau, L., Fertin, G., Rusu, I.: Maximal strip recovery problem with gaps: hardness and approximation algorithms. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 710\u2013719. Springer, Heidelberg (2009)"},{"key":"9_CR3","doi-asserted-by":"publisher","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.: On recovering synthetic blocks from comparative maps. Journal of Combinatorial Optimization\u00a018, 307\u2013318 (2009)","journal-title":"Journal of Combinatorial Optimization"},{"key":"9_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":"9_CR5","unstructured":"Jiang, H., Li, Z., Lin, G., Wang, L., Zhu, B.: Exact and approximation algorithms for the complementary maximal strip recovery problem. Journal of Combinatorial Optimization (2010) (accepted for publication on November 3, 2010)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-642-10631-6_63","volume-title":"Algorithms and Computation","author":"M. Jiang","year":"2009","unstructured":"Jiang, M.: Inapproximability of maximal strip recovery. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 616\u2013625. Springer, Heidelberg (2009)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-642-14553-7_8","volume-title":"Frontiers in Algorithmics","author":"M. Jiang","year":"2010","unstructured":"Jiang, M.: Inapproximability of maximal strip recovery: II. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol.\u00a06213, pp. 53\u201364. Springer, Heidelberg (2010)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Li, Z., Goebel, R., Wang, L., Lin, G.: An improved approximation algorithm for the complementary maximal strip recovery problem. Technical Report TR11-02, Department of Computing Science, University of Alberta (January 2011)","DOI":"10.1007\/978-3-642-21204-8_9"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1089\/cmb.2009.0084","volume":"17","author":"L. Wang","year":"2010","unstructured":"Wang, L., Zhu, B.: On the tractability of maximal strip recovery. Journal of Computational Biology\u00a017, 907\u2013914 (2010); Correction 18, 129 (2011)","journal-title":"Journal of Computational Biology"},{"key":"9_CR10","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 Transactions on Computational Biology and Bioinformatics\u00a04, 515\u2013522 (2007)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21204-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,24]],"date-time":"2021-11-24T09:28:38Z","timestamp":1637746118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21204-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212031","9783642212048"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21204-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}