{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:13:17Z","timestamp":1725516797426},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_31","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"309-318","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Algorithms for SNP Haplotype Block Selection Problems"],"prefix":"10.1007","author":[{"given":"Yaw-Ling","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1086\/377106","volume":"73","author":"E.C. Anderson","year":"2003","unstructured":"Anderson, E.C., Novembre, J.: Finding Haplotype Block Boundaries by Using the Minimum-Description-Length Principle. Am. J. of Human Genetics\u00a073, 336\u2013354 (2003)","journal-title":"Am. J. of Human Genetics"},{"issue":"5","key":"31_CR2","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1137\/S0097539796313477","volume":"30","author":"R. Cole","year":"2002","unstructured":"Cole, R., Farach, M., Hariharan, R., Przytycka, T., Thorup, M.: An O(n logn) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. SIAM Journal on Computing\u00a030(5), 1385\u20131404 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1038\/ng1001-229","volume":"29","author":"M. Daly","year":"2001","unstructured":"Daly, M., Rioux, J., Schafiner, S., Hudson, T., Lander, E.: Highresolution Haplotype Structure in the Human Genome. Nature Genetics\u00a029, 229\u2013232 (2001)","journal-title":"Nature Genetics"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1038\/nature00864","volume":"418","author":"E. Dawson","year":"2002","unstructured":"Dawson, E., Abecasis, G., et al.: A First-Generation Linkage Disequilibrium Map of Human Dhromosome 22. Nature\u00a0418, 544\u2013548 (2002)","journal-title":"Nature"},{"issue":"5576","key":"31_CR5","doi-asserted-by":"publisher","first-page":"2225","DOI":"10.1126\/science.1069424","volume":"296","author":"S.B. Gabriel","year":"2002","unstructured":"Gabriel, S.B., Schaffner, S.F., Nguyen, H., et al.: The Structure of Haplotype Blocks in the Human Genome. Science\u00a0296(5576), 2225\u20132229 (2002)","journal-title":"Science"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Greenspan, G., Geiger, D.: Model-Based Inference of Haplotype Block Variation. In: Seventh Annual International Conference on Computational Molecular Biology (2003)","DOI":"10.1145\/640075.640092"},{"key":"31_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"31_CR8","unstructured":"International HapMap Project, http:\/\/www.hapmap.org\/index.html.en"},{"issue":"2","key":"31_CR9","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast Algorithms for Finding Nearest Common Ancestors. SIAM Journal on Computing\u00a013(2), 338\u2013355 (1984)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR10","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1093\/genetics\/111.1.147","volume":"111","author":"R.R. Hudson","year":"1985","unstructured":"Hudson, R.R., Kaplan, N.L.: Statistical Properties of the Number of Recombination Events in the History of a Sample of DNA Sequences. Genetics\u00a0111, 147\u2013164 (1985)","journal-title":"Genetics"},{"key":"31_CR11","unstructured":"Li, W.H., Graur, D.: Fundamentals of Molecular Evolution. Sinauer Associates, Inc. (1991)"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1126\/science.1065573","volume":"294","author":"N. Patil","year":"2001","unstructured":"Patil, N., Berno, A.J., Hinds, D.A., et al.: Blocks of Limited Haplotype Diversity Revealed by High Resolution Scanning of Human Chromosome 21. Science\u00a0294, 1719\u20131723 (2001)","journal-title":"Science"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1038\/35075590","volume":"411","author":"D. Reich","year":"2001","unstructured":"Reich, D., Cargill, M., Lander, E., et al.: Linkage Disequilibrium in the Human Genome. Nature\u00a0411, 199\u2013204 (2001)","journal-title":"Nature"},{"issue":"3","key":"31_CR14","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-Line Construction of Suffix Trees. Algorithmica\u00a014(3), 249\u2013260 (1995)","journal-title":"Algorithmica"},{"issue":"1","key":"31_CR15","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1093\/bioinformatics\/bth482","volume":"21","author":"K. Zhang","year":"2005","unstructured":"Zhang, K., Qin, Z., Chen, T., Liu, J.S., Waterman, M.S., Sun, F.: HapBlock: Haplotype Block Partitioning and Tag SNP Selection Software Using a Set of Dynamic Programming Algorithms. Bioinformatics\u00a021(1), 131\u2013134 (2005)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T17:59:29Z","timestamp":1631642369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}