{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:44Z","timestamp":1759637804525,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_47","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T15:12:41Z","timestamp":1435072361000},"page":"601-608","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Improved Kernel for the Complementary Maximal Strip Recovery Problem"],"prefix":"10.1007","author":[{"given":"Shuai","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"47_CR1","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer-Verlag (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"47_CR2","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to fixed-parameter algorithms (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"issue":"1","key":"47_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. ACM SIGACT News 38(1), 31\u201345 (2007)","journal-title":"ACM SIGACT News"},{"issue":"4","key":"47_CR5","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 4(4), 515\u2013522 (2007)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"issue":"7","key":"47_CR6","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 17(7), 907\u2013914 (2010)","journal-title":"Journal of Computational Biology"},{"key":"47_CR7","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. 5878, pp. 710\u2013719. Springer, Heidelberg (2009)"},{"key":"47_CR8","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. 5878, pp. 616\u2013625. Springer, Heidelberg (2009)"},{"key":"47_CR9","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. 6213, pp. 53\u201364. Springer, Heidelberg (2010)"},{"key":"47_CR10","series-title":"Lecture Notes in Computer Science (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. 4645, pp. 277\u2013288. Springer, Heidelberg (2007)"},{"issue":"3","key":"47_CR11","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 syntenic blocks from comparative maps. J. Comb. Optim. 18(3), 307\u2013318 (2009)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"47_CR12","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s10878-010-9366-y","volume":"23","author":"H Jiang","year":"2012","unstructured":"Jiang, H., Li, Z., Lin, G., Wang, L., Zhu, B.: Exact and approximation algorithms for the complementary maximal strip recovery problem. J. Comb. Optim. 23(4), 493\u2013506 (2012)","journal-title":"J. Comb. Optim."},{"issue":"3","key":"47_CR13","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1016\/j.jcss.2011.10.014","volume":"78","author":"Z Li","year":"2012","unstructured":"Li, Z., Goebel, R., Wang, L., Lin, G.: An improved approximation algorithm for the complementary maximal strip recovery problem. J. Comput. Syst. Sci. 78(3), 720\u2013730 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"441","key":"47_CR14","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.tcs.2012.04.034","volume":"440","author":"L Bulteau","year":"2012","unstructured":"Bulteau, L., Fertin, G., Jiang, M., Rusu, I.: Tractability and approximability of maximal strip recovery. Theor. Comput. Sci. 440(441), 14\u201328 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"47_CR15","doi-asserted-by":"crossref","unstructured":"Jiang, H., Zhu, B.: A linear kernel for the complementary maximal strip recovery problem. Journal of Computer and System Sciences (2014)","DOI":"10.1016\/j.jcss.2014.03.005"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T21:53:36Z","timestamp":1676584416000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}