{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:45:44Z","timestamp":1742971544190,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319947754"},{"type":"electronic","value":"9783319947761"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94776-1_46","type":"book-chapter","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T01:48:06Z","timestamp":1530236886000},"page":"554-566","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On a Fixed Haplotype Variant of the Minimum Error Correction Problem"],"prefix":"10.1007","author":[{"given":"Axel","family":"Goblet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Kelk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mat\u00fa\u0161","family":"Mihal\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georgios","family":"Stamoulis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"key":"46_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. 1203, pp. 288\u2013298. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62592-5_80"},{"issue":"16","key":"46_CR2","doi-asserted-by":"publisher","first-page":"i153","DOI":"10.1093\/bioinformatics\/btn298","volume":"24","author":"V Bansal","year":"2008","unstructured":"Bansal, V., Bafna, V.: HapCUT: an efficient and accurate algorithm for the haplotype assembly problem. Bioinformatics 24(16), i153\u2013i159 (2008)","journal-title":"Bioinformatics"},{"issue":"9","key":"46_CR3","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1089\/cmb.2015.0220","volume":"23","author":"P Bonizzoni","year":"2016","unstructured":"Bonizzoni, P., Dondi, R., Klau, G.W., Pirola, Y., Pisanti, N., Zaccaria, S.: On the minimum error correction problem for haplotype assembly in diploid and polyploid genomes. J. Comput. Biol. 23(9), 718\u2013736 (2016)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"46_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s00453-007-0029-z","volume":"49","author":"R Cilibrasi","year":"2007","unstructured":"Cilibrasi, R., Van Iersel, L., Kelk, S., Tromp, J.: The complexity of the single individual SNP haplotyping problem. Algorithmica 49(1), 13\u201336 (2007)","journal-title":"Algorithmica"},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"International HapMap Consortium, et al.: A haplotype map of the human genome. Nature 437(7063), 1299 (2005)","DOI":"10.1038\/nature04226"},{"key":"46_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2016","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity, vol. 201. Springer, London (2016). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"issue":"1","key":"46_CR7","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1186\/s12859-018-2012-x","volume":"19","author":"M Etemadi","year":"2018","unstructured":"Etemadi, M., Bagherian, M., Chen, Z.-Z., Wang, L.: Better ILP models for haplotype assembly. BMC Bioinform. 19(1), 52 (2018)","journal-title":"BMC Bioinform."},{"key":"46_CR8","unstructured":"Feige, U.: NP-hardness of hypercube 2-segmentation (2014). arXiv preprint arXiv:1411.0821"},{"key":"46_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-27801-6_10","volume-title":"Combinatorial Pattern Matching","author":"Y Jiao","year":"2004","unstructured":"Jiao, Y., Xu, J., Li, M.: On the k-closest substring and k-consensus pattern problems. In: Sahinalp, S.C., Muthukrishnan, S., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 130\u2013144. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27801-6_10"},{"key":"46_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/3-540-44676-1_15","volume-title":"Algorithms \u2014 ESA 2001","author":"G Lancia","year":"2001","unstructured":"Lancia, G., Bafna, V., Istrail, S., Lippert, R., Schwartz, R.: SNPs problems, complexity, and algorithms. In: auf der Heide, F.M. (ed.) ESA 2001. LNCS, vol. 2161, pp. 182\u2013193. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44676-1_15"},{"issue":"1","key":"46_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1093\/bib\/3.1.23","volume":"3","author":"R Lippert","year":"2002","unstructured":"Lippert, R., Schwartz, R., Lancia, G., Istrail, S.: Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem. Brief. Bioinform. 3(1), 23\u201331 (2002)","journal-title":"Brief. Bioinform."},{"issue":"2","key":"46_CR12","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1145\/506147.506149","volume":"49","author":"R Ostrovsky","year":"2002","unstructured":"Ostrovsky, R., Rabani, Y.: Polynomial-time approximation schemes for geometric min-sum median clustering. J. ACM 49(2), 139\u2013156 (2002)","journal-title":"J. ACM"},{"issue":"3","key":"46_CR13","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43(3), 425\u2013440 (1991)","journal-title":"J. Comput. Syst. Sci."},{"issue":"11","key":"46_CR14","doi-asserted-by":"publisher","first-page":"3931","DOI":"10.1109\/TIT.2005.856940","volume":"51","author":"KT Phelps","year":"2005","unstructured":"Phelps, K.T., Rifa, J., Villanueva, M.: Rank and kernel of binary hadamard codes. IEEE Trans. Inf. Theory 51(11), 3931\u20133937 (2005)","journal-title":"IEEE Trans. Inf. Theory"}],"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-94776-1_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:36:32Z","timestamp":1710347792000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94776-1_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319947754","9783319947761"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94776-1_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qing Dao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon2018.sdu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}