{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:09:29Z","timestamp":1725530969214},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642015502"},{"type":"electronic","value":"9783642015519"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-01551-9_19","type":"book-chapter","created":{"date-parts":[[2009,4,28]],"date-time":"2009-04-28T10:29:20Z","timestamp":1240914560000},"page":"186-197","source":"Crossref","is-referenced-by-count":0,"title":["Pure Parsimony Xor Haplotyping"],"prefix":"10.1007","author":[{"given":"Paola","family":"Bonizzoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianluca","family":"Della Vedova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Dondi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Pirola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-540-27801-6_2","volume-title":"Combinatorial Pattern Matching","author":"T. Barzuza","year":"2004","unstructured":"Barzuza, T., Beckmann, J.S., Shamir, R., Pe\u2019er, I.: Computational problems in perfect phylogeny haplotyping: Xor-genotypes and tag SNPs. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 14\u201331. Springer, Heidelberg (2004)"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1109\/TCBB.2007.1063","volume":"5","author":"T. Barzuza","year":"2008","unstructured":"Barzuza, T., Beckmann, J.S., Shamir, R., Pe\u2019er, I.: Computational problems in perfect phylogeny haplotyping: Typing without calling the allele. IEEE\/ACM Trans.\u00a0on Comput.\u00a0Biol.\u00a0and Bioinform.\u00a05(1), 101\u2013109 (2008)","journal-title":"IEEE\/ACM Trans.\u00a0on Comput.\u00a0Biol.\u00a0and Bioinform."},{"issue":"9","key":"19_CR3","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/360336.360343","volume":"19","author":"J.R. Bitner","year":"1976","unstructured":"Bitner, J.R., Ehrlich, G., Reingold, E.M.: Efficient generation of the binary reflected Gray code and its applications. Comm.\u00a0of the ACM\u00a019(9), 517\u2013521 (1976)","journal-title":"Comm.\u00a0of the ACM"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1287\/moor.13.1.99","volume":"13","author":"R.E. Bixby","year":"1988","unstructured":"Bixby, R.E., Wagner, D.K.: An almost linear-time algorithm for graph realization. Mathematics of Operations Research\u00a013, 99\u2013123 (1988)","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/TCBB.2006.24","volume":"3","author":"D.G. Brown","year":"2006","unstructured":"Brown, D.G., Harrower, I.M.: Integer programming approaches to haplotype inference by pure parsimony. IEEE\/ACM Trans.\u00a0on Comput.\u00a0Biol.\u00a0and Bioinform.\u00a03(2), 141\u2013154 (2006)","journal-title":"IEEE\/ACM Trans.\u00a0on Comput.\u00a0Biol.\u00a0and Bioinform."},{"key":"19_CR6","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Graduate Texts in Mathematics, vol.\u00a0173. Springer, Heidelberg (2005)","edition":"3"},{"key":"19_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"issue":"9","key":"19_CR8","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E. Fredkin","year":"1960","unstructured":"Fredkin, E.: Trie memory. Comm.\u00a0of the ACM\u00a03(9), 490\u2013499 (1960)","journal-title":"Comm.\u00a0of the ACM"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0000(80)90042-2","volume":"21","author":"S. Fujishige","year":"1980","unstructured":"Fujishige, S.: An efficient PQ-graph algorithm for solving the graph realization problem. J.\u00a0of Computer and System Science\u00a021, 63\u201386 (1980)","journal-title":"J.\u00a0of Computer and System Science"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Haplotyping as perfect phylogeny: Conceptual framework and efficient solutions. In: Proc.\u00a06th RECOMB, pp. 166\u2013175 (2002)","DOI":"10.1145\/565196.565218"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-44888-8_11","volume-title":"Combinatorial Pattern Matching","author":"D. Gusfield","year":"2003","unstructured":"Gusfield, D.: Haplotyping by pure parsimony. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 144\u2013155. Springer, Heidelberg (2003)"},{"issue":"4","key":"19_CR12","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1287\/ijoc.1040.0085","volume":"16","author":"G. Lancia","year":"2004","unstructured":"Lancia, G., Pinotti, M.C., Rizzi, R.: Haplotyping populations by pure parsimony: Complexity of exact and approximation algorithms. INFORMS J. Comp.\u00a016(4), 348\u2013359 (2004)","journal-title":"INFORMS J. Comp."},{"issue":"4","key":"19_CR13","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0036144595295272","volume":"39","author":"C. Savage","year":"1997","unstructured":"Savage, C.: A survey of combinatorial Gray codes. SIAM Rev.\u00a039(4), 605\u2013629 (1997)","journal-title":"SIAM Rev."},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"The International HapMap Consortium. A haplotype map of the human genome. Nature\u00a0437(7063), 1299\u20131320 (2005)","DOI":"10.1038\/nature04226"},{"issue":"6","key":"19_CR15","first-page":"905","volume":"11","author":"W.T. Tutte","year":"1960","unstructured":"Tutte, W.T.: An algorithm for determining whether a given binary matroid is graphic. Proc.\u00a0of the American Mathematical Society\u00a011(6), 905\u2013917 (1960)","journal-title":"Proc.\u00a0of the American Mathematical Society"},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/TCBB.2007.70232","volume":"5","author":"L. Iersel van","year":"2008","unstructured":"van Iersel, L., Keijsper, J., Kelk, S., Stougie, L.: Shorelines of islands of tractability: Algorithms for parsimony and minimum perfect phylogeny haplotyping problems. IEEE\/ACM Trans.\u00a0on Comput.\u00a0Biol.\u00a0and Bioinform.\u00a05(2), 301\u2013312 (2008)","journal-title":"IEEE\/ACM Trans.\u00a0on Comput.\u00a0Biol.\u00a0and Bioinform."}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01551-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:44:36Z","timestamp":1558291476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01551-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642015502","9783642015519"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01551-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}