{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:23:07Z","timestamp":1773274987214,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540734369","type":"print"},{"value":"9783540734376","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73437-6_17","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T17:36:44Z","timestamp":1187026604000},"page":"150-161","source":"Crossref","is-referenced-by-count":12,"title":["Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants"],"prefix":"10.1007","author":[{"given":"Yufeng","family":"Wu","sequence":"first","affiliation":[]},{"given":"Dan","family":"Gusfield","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1142\/S0219720004000545","volume":"2","author":"N. El-Mabrouk","year":"2004","unstructured":"El-Mabrouk, N.: Deriving haplotypes through recombination and gene conversion. J. of Bioinformatics and Computational Biology\u00a02, 241\u2013256 (2004)","journal-title":"J. of Bioinformatics and Computational Biology"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"1836","DOI":"10.1093\/bioinformatics\/bth148","volume":"20","author":"N. El-Mabrouk","year":"2004","unstructured":"El-Mabrouk, N., Labuda, D.: Haplotype histories as pathways of recombinations. Bioinformatics\u00a020, 1836\u20131841 (2004)","journal-title":"Bioinformatics"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1089\/cmb.2005.12.1243","volume":"12","author":"G. Kimmel","year":"2005","unstructured":"Kimmel, G., Shamir, R.: A block-free hidden markov model for genotypes and its application to disease association. J. of Comp. Bio.\u00a012, 1243\u20131260 (2005)","journal-title":"J. of Comp. Bio."},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1038\/304412a0","volume":"304","author":"M. Kreitman","year":"1983","unstructured":"Kreitman, M.: Nucleotide polymorphism at the alcohol dehydrogenase locus of drosophila melanogaster. Nature\u00a0304, 412\u2013417 (1983)","journal-title":"Nature"},{"key":"17_CR5","unstructured":"McMillan, L., Moore, K.: http:\/\/www.unc.edu\/courses\/2007spring\/comp\/790\/087\/?p=11"},{"key":"17_CR6","unstructured":"Myers, S.: The detection of recombination events using DNA sequence data, PhD dissertation, Dept. of Statistics, University of Oxford, Oxford, England (2003)"},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1093\/genetics\/163.1.375","volume":"163","author":"S.R. Myers","year":"2003","unstructured":"Myers, S.R., Griffiths, R.C.: Bounds on the minimum number of recombination events in a sample history. Genetics\u00a0163, 375\u2013394 (2003)","journal-title":"Genetics"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1038\/907","volume":"19","author":"D. Nickerson","year":"1998","unstructured":"Nickerson, D., Taylor, S., Weiss, K., Clark, A., et al.: DNA Sequence Diversity in a 9.7-kb region of the human lipoprotein lipase gene. Nature Genetics\u00a019, 233\u2013240 (1998)","journal-title":"Nature Genetics"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Rastas, P., Koivisto, M., Mannila, H., Ukkonen, E.: A Hidden Markov Technique for Haplotype Reconstruction. In: Proceedings of Workshop on Algorithm of Bioinformatics (WABI 2005) pp. 140\u2013151 (2005)","DOI":"10.1007\/11557067_12"},{"key":"17_CR10","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. Am. J. Human Genetics\u00a078, 629\u2013644 (2006)","journal-title":"Am. J. Human Genetics"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Schwartz, R., Clark, A., Istrail, S.: Methods for Inferring Block-Wise Ancestral History from Haploid Sequences. In: Proceedings of Workshop on Algorithm of Bioinformatics (WABI 2002), vol. 2452, pp. 44\u201359 (2002)","DOI":"10.1007\/3-540-45784-4_4"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Song, Y.S., Wu, Y., Gusfield, D.: Efficient computation of close lower and upper bounds on the minimum number of needed recombinations in the evolution of biological sequences. Bioinformatics, vol. 421, pp. i413\u2013i422. In: Proceedings of ISMB (2005)","DOI":"10.1093\/bioinformatics\/bti1033"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"2383","DOI":"10.1534\/genetics.106.057638","volume":"173","author":"Y. Tan","year":"2006","unstructured":"Tan, Y., Fu, Y.: A Novel Method for Estimating Linkage Maps. Genetics\u00a0173, 2383\u20132390 (2006)","journal-title":"Genetics"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1038\/nature02340","volume":"428","author":"G.W. Tyson","year":"2004","unstructured":"Tyson, G.W., Chapman, J., Hugenholtz, P., Allen, E., Ram, R., Richardson, P., Solovyev, V., Rubin, E., Rokhsar, D., Banfield, J.: Community structure and metabolism through reconstruction of microbial genomes from the environment. Nature\u00a0428, 37\u201343 (2004)","journal-title":"Nature"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Ukkonen, E.: Finding Founder Sequences from a Set of Recombinants. In: Proceedings of Workshop on Algorithm of Bioinformatics (WABI 2002), vol. 2452, pp. 277\u2013286 (2002)","DOI":"10.1007\/3-540-45784-4_21"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73437-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T17:40:17Z","timestamp":1629567617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73437-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540734369","9783540734376"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73437-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}