{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:48:31Z","timestamp":1725490111492},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540741251"},{"type":"electronic","value":"9783540741268"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74126-8_9","type":"book-chapter","created":{"date-parts":[[2007,8,23]],"date-time":"2007-08-23T11:37:50Z","timestamp":1187869070000},"page":"85-97","source":"Crossref","is-referenced-by-count":11,"title":["Haplotype Inference Via Hierarchical Genotype Parsing"],"prefix":"10.1007","author":[{"given":"Pasi","family":"Rastas","sequence":"first","affiliation":[]},{"given":"Esko","family":"Ukkonen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1038\/ng1001-229","volume":"29","author":"M. Daly","year":"2001","unstructured":"Daly, M., Rioux, J., Schaffner, S., Hudson, T., Lander, E.: High-resolution haplotype structure in the human genome. Nature Genetics\u00a029, 229\u2013232 (2001)","journal-title":"Nature Genetics"},{"key":"9_CR2","volume-title":"Computers and Intractability: A Guide to the Theory on NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory on NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1089\/cmb.1996.3.479","volume":"3","author":"R. Griffiths","year":"1996","unstructured":"Griffiths, R., Marjoram, P.: Ancestral inference from samples of DNA sequences with recombination. Journal of Computational Biology\u00a03, 479\u2013502 (1996)","journal-title":"Journal of Computational Biology"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Haplotype inference by pure parsimony. Technical Report CSE-2003-2, Department of Computer Science, University of California (2003)","DOI":"10.1007\/3-540-44888-8_11"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"D.S. Hirschberg","year":"1975","unstructured":"Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Comm. ACM\u00a018, 341\u2013343 (1975)","journal-title":"Comm. ACM"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0166-218X(98)00074-2","volume":"88","author":"J. Kececioglu","year":"1998","unstructured":"Kececioglu, J., Gusfield, D.: Reconstructing a history of recombinations from a set of sequences. Discrete Applied Mathematics\u00a088, 239\u2013260 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR7","first-page":"473","volume-title":"Proc. STOC 1998","author":"J. Kleinberg","year":"1998","unstructured":"Kleinberg, J., Papadimitriou, C., Raghavan, P.: Segmentation problems. In: Proc. STOC 1998, New York, USA, pp. 473\u2013482. ACM Press, New York (1998)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/978-3-540-27812-2_15","volume-title":"Theory Is Forever","author":"M. Koivisto","year":"2004","unstructured":"Koivisto, M., Rastas, P., Ukkonen, E.: Recombination systems. In: Karhum\u00e4ki, J., Maurer, H., P\u0103un, G., Rozenberg, G. (eds.) Theory Is Forever. LNCS, vol.\u00a03113, pp. 159\u2013169. Springer, Heidelberg (2004)"},{"issue":"suppl. 2","key":"9_CR9","first-page":"ii173","volume":"21","author":"M. Lajoie","year":"2005","unstructured":"Lajoie, M., El-Mabrouk, N.: Recovering haplotype structure through recombination and gene conversion. Bioinformatics\u00a021(suppl. 2), ii173\u2013ii179 (2005)","journal-title":"Bioinformatics"},{"key":"9_CR10","unstructured":"Lancia, G., Pinotti, C., Rizzi, R.: Haplotyping populations: Complexity and approximations. Technical Report DIT-02-0080, Department of Information and Communication Technology, University of Trento (2002)"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1086\/344347","volume":"71","author":"S. Lin","year":"2002","unstructured":"Lin, S., Cutler, D.J., Zwick, M.E., Chakravarti, A.: Haplotype inference in random population samples. American Journal of Human Genetics\u00a071, 1129\u20131137 (2002)","journal-title":"American Journal of Human Genetics"},{"key":"9_CR12","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/11557067_20","volume-title":"Algorithms in Bioinformatics","author":"R.. Lyngs\u00f8","year":"2005","unstructured":"Lyngs\u00f8, R., Song, Y., Hein, J.: Minimum recombination histories by branch and bound. In: Casadio, R., Myers, G. (eds.) WABI 2005. LNCS (LNBI), vol.\u00a03692, pp. 239\u2013250. Springer, Heidelberg (2005)"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1038\/nature01400","volume":"421","author":"S. P\u00e4\u00e4bo","year":"2003","unstructured":"P\u00e4\u00e4bo, S.: The mosaic in our genome. Nature\u00a0421, 409\u2013412 (2003)","journal-title":"Nature"},{"key":"9_CR14","unstructured":"Rastas, P.: Haplotyyppien m\u00e4\u00e4ritys (Haplotype inference). Report C-2004-69 (M.Sc. thesis), Department of Computer Science, University of Helsinki (2004)"},{"key":"9_CR15","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/11557067_12","volume-title":"Algorithms in Bioinformatics","author":"P. Rastas","year":"2005","unstructured":"Rastas, P., Koivisto, M., Mannila, H., Ukkonen, E.: A hidden markov technique for haplotype reconstruction. In: Casadio, R., Myers, G. (eds.) WABI 2005. LNCS (LNBI), vol.\u00a03692, pp. 140\u2013151. Springer, Heidelberg (2005)"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1086\/502802","volume":"78","author":"P. Scheet","year":"2006","unstructured":"Scheet, P., Stephens, M.: A fast and flexible statistical model for large-scale population genotype data: applications to inferring missing genotypes and haplotypic phase. American Journal of Human Genetics\u00a078, 629\u2013644 (2006)","journal-title":"American Journal of Human Genetics"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-45784-4_4","volume-title":"Algorithms in Bioinformatics","author":"R. Schwartz","year":"2002","unstructured":"Schwartz, R., Clark, A., Istrail, S.: Methods for inferring block-wise ancestral history from haploid sequences. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, pp. 44\u201359. Springer, Heidelberg (2002)"},{"key":"9_CR18","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1038\/nature04226","volume":"437","author":"The International HapMap Consortium","year":"2005","unstructured":"The International HapMap Consortium: A haplotype map of the human genome. Nature 437, 1299\u20131320 (2005)","journal-title":"Nature"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-45784-4_21","volume-title":"Algorithms in Bioinformatics","author":"E. Ukkonen","year":"2002","unstructured":"Ukkonen, E.: Finding founder sequences from a set of recombinants. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, pp. 277\u2013286. Springer, Heidelberg (2002)"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1038\/nature01252","volume":"420","author":"C. Wade","year":"2002","unstructured":"Wade, C., Kulbokas, E., Kirby, A., Zody, M., Mullikin, J., Lander, E., Daly, M.: The mosaic structure of variation in the laboratory mouse genome. Nature\u00a0420, 574\u2013578 (2002)","journal-title":"Nature"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1089\/106652701300099119","volume":"8","author":"L. Wang","year":"2001","unstructured":"Wang, L., Zhang, K., Zhang, L.: Perfect phylogenetic networks with recombination. Journal of Computational Biology\u00a08, 69\u201378 (2001)","journal-title":"Journal of Computational Biology"},{"key":"9_CR22","volume-title":"Proc. CPM 2007","author":"Y. Wu","year":"2007","unstructured":"Wu, Y., Gusfield, D.: Improved algorithms for inferring the minimum mosaic of a set of recombinants. In: Proc. CPM 2007, Springer, Heidelberg (to appear, 2007)"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74126-8_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:11:42Z","timestamp":1619503902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74126-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540741251","9783540741268"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74126-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}