{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:29:43Z","timestamp":1758274183584},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540395836"},{"type":"electronic","value":"9783540395843"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11851561_7","type":"book-chapter","created":{"date-parts":[[2006,9,22]],"date-time":"2006-09-22T12:49:41Z","timestamp":1158929381000},"page":"68-79","source":"Crossref","is-referenced-by-count":1,"title":["Phylogenetic Network Inferences Through Efficient Haplotyping"],"prefix":"10.1007","author":[{"given":"Yinglei","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunmei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Russell L.","family":"Malmberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liming","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","volume":"23","author":"S. Arnborg","year":"1989","unstructured":"Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Applied Mathematics\u00a023, 11\u201324 (1989)","journal-title":"Discrete Applied Mathematics"},{"key":"7_CR2","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/11557067_11","volume-title":"Algorithms in Bioinformatics","author":"R. Cilibrasi","year":"2005","unstructured":"Cilibrasi, R., Iersel, L., Kelk, S., Tromp, J.: On the complexity of several haplotyping problems. In: Casadio, R., Myers, G. (eds.) WABI 2005. LNCS (LNBI), vol.\u00a03692, pp. 128\u2013139. Springer, Heidelberg (2005)"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1086\/382227","volume":"74","author":"D.C. Crawford","year":"2004","unstructured":"Crawford, D.C., Carlson, C.S., Rieder, M.J., Carrington, D.P., Yi, Q., Smith, J.D., Eberle, M.A., Kruglyak, L., Nickerson, D.A.: Haplotype diversity across 100 candidate genes for inflammation, lipid metabolism, and blood pressure regulation in two populations. American J. of Human Genetics\u00a074, 610\u2013622 (2004)","journal-title":"American J. of Human Genetics"},{"issue":"2","key":"7_CR4","first-page":"111","volume":"7","author":"A.G. Clark","year":"1990","unstructured":"Clark, A.G.: Inference of haplotypes from PCR-amplified samples of diploid populations. Molecular Biology and Evolution\u00a07(2), 111\u2013122 (1990)","journal-title":"Molecular Biology and Evolution"},{"key":"7_CR5","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/11732990_20","volume-title":"Research in Computational Molecular Biology","author":"Z. Ding","year":"2006","unstructured":"Ding, Z., Filkov, V., Gusfield, D.: A Linear-Time Algorithm for the Perfect Phylogeny Haplotyping (PPH) Problem. In: Apostolico, A., Guerra, C., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2006. LNCS (LNBI), vol.\u00a03909, pp. 231\u2013245. Springer, Heidelberg (2006)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Eskin, E., Halperin, E., Karp, R.M.: Large scale reconstruction of haplotypes from genotype data. In: Proc. 7th Int\u2019l Conf. on Research in Comput. Molecular Biol. RECOMB 2003, pp. 104\u2013113 (2003)","DOI":"10.1145\/640075.640088"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1089\/1066527041410300","volume":"11","author":"G. Greenspan","year":"2004","unstructured":"Greenspan, G., Greiger, D.: Model-based inference of haplotype block variation. J. of Computational Biology\u00a011, 493\u2013504 (2004)","journal-title":"J. of Computational Biology"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Haplotyping as perfect phylogeny: conceptual framework and efficient solutions. In: Proc. 6th Int\u2019l Conf. on Research in Comput. Molecular Biol. RECOMB 2002, pp. 166\u2013175 (2002)","DOI":"10.1145\/565196.565218"},{"key":"7_CR9","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/11415770_17","volume-title":"Research in Computational Molecular Biology","author":"D. Gusfield","year":"2005","unstructured":"Gusfield, D., Bansal, V.: A fundamental decomposition theory for phylogenetic networks and incompatible characters. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2005. LNCS (LNBI), vol.\u00a03500, pp. 217\u2013232. Springer, Heidelberg (2005)"},{"key":"7_CR10","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 pasimony. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 144\u2013155. Springer, Heidelberg (2003)"},{"key":"7_CR11","unstructured":"Gusfield, D.: A practical algorithm for optimal inference of haplotypes from diploid populations. In: Proc. 8th Conf. on Intelligent Systems for Molecular Biology ISMB 2000, pp. 183\u2013189 (2000)"},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1142\/S0219720004000521","volume":"2","author":"D. Gusfield","year":"2004","unstructured":"Gusfield, D., Eddhu, S., Langley, C.: Optimal efficient reconstruction of phylogenetic networks with constrained recombination. J. of Bioinformatics and Computational Biology\u00a02(1), 173\u2013213 (2004)","journal-title":"J. of Bioinformatics and Computational Biology"},{"key":"7_CR13","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-540-24719-7_2","volume-title":"Computational Methods for SNPs and Haplotype Inference","author":"D. Gusfield","year":"2004","unstructured":"Gusfield, D.: An overview of combinatorial methods for haplotype inference. In: Istrail, S., Waterman, M.S., Clark, A. (eds.) DIMACS\/RECOMB Satellite Workshop 2002. LNCS (LNBI), vol.\u00a02983, pp. 9\u201325. Springer, Heidelberg (2004)"},{"issue":"3","key":"7_CR14","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1089\/10665270152530863","volume":"8","author":"D. Gusfield","year":"2001","unstructured":"Gusfield, D.: Inference of haplotypes from samples of diploid populations: complexity and algorithms. J. of Computational Biology\u00a08(3), 305\u2013324 (2001)","journal-title":"J. of Computational Biology"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Halperin, E., Karp, R.M.: Perfect phylogeny and haplotype assignment. In: Proc. 8th Int\u2019l Conf. on Research in Comput. Molecular Biol. RECOMB 2004, pp. 10\u201319 (2004)","DOI":"10.1145\/974614.974617"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0025-5564(90)90123-G","volume":"98","author":"J. Hein","year":"1990","unstructured":"Hein, J.: Reconstructing evolution of squences subject to recombination using parsimony. Mathematical Biosciences\u00a098, 185\u2013200 (1990)","journal-title":"Mathematical Biosciences"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Kimmel, G., Shamir, R.: Maximum likelihood resolution of multi-block genotypes. In: Proc. 8th Int\u2019l Conf. on Research in Comput. Molecular Biol. RECOMB 2004, pp. 2\u20139 (2004)","DOI":"10.1145\/974614.974616"},{"issue":"2","key":"7_CR18","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1142\/S0219720005001090","volume":"3","author":"G. Kimmel","year":"2005","unstructured":"Kimmel, G., Shamir, R.: The incomplete perfect phylogeny haplotype problem. J. of Bioinformatics and Computational Biology\u00a03(2), 359\u2013384 (2005)","journal-title":"J. of Bioinformatics and Computational Biology"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1109\/TCBB.2004.10","volume":"1","author":"B.M.E. Moret","year":"2004","unstructured":"Moret, B.M.E., Nakhleh, L., Warnow, T., Linder, C.R., Tholse, A., Padolina, A., Sun, J., Timme, R.: Phylogenetic networks: Modeling, reconstructibility, and accuracy. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a01, 13\u201323 (2004)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"7_CR20","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"},{"issue":"1","key":"7_CR21","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1086\/338446","volume":"70","author":"T. Niu","year":"2002","unstructured":"Niu, T., Qin, Z.S., Xu, X., Liu, J.S.: Bayesian haplotype inference for multiple linked single-nucleotide polymorphisms. American J. of Human Genetics\u00a070(1), 157\u2013169 (2002)","journal-title":"American J. of Human Genetics"},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0169-5347(00)02026-7","volume":"16","author":"D. Posada","year":"2001","unstructured":"Posada, D., Crandall, K.: Intraspecific gene genealogies: trees grafting into networks. Trends in Ecology and Evolution\u00a016, 37\u201345 (2001)","journal-title":"Trends in Ecology and Evolution"},{"key":"7_CR23","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":"7_CR24","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph Minors II. Algorithmic aspects of tree-width. J. of Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"J. of Algorithms"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Sharan, R., Halld\u00f3rsson, B.V., Istrail, S.: Islands of tractability for parsimony haplotyping. In: Proc. IEEE Computational Systems Bioinformatics Conf. CSB 2005, pp. 65\u201372 (2005)","DOI":"10.1109\/CSB.2005.37"},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/s00285-003-0227-5","volume":"48","author":"Y.S. Song","year":"2004","unstructured":"Song, Y.S., Hein, J.: On the minimum number of recombination events in the evolutionary history of DNA sequences. J. of Mathematical Biology\u00a048, 160\u2013186 (2004)","journal-title":"J. of Mathematical Biology"},{"key":"7_CR27","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/11557067_13","volume-title":"Algorithms in Bioinformatics","author":"Y.S. Song","year":"2005","unstructured":"Song, Y.S., Wu, Y., Gusfield, D.: Algorithms for imperfect phylogeny haplotyping (IPPH) with a single homoplasy or recombination event. In: Casadio, R., Myers, G. (eds.) WABI 2005. LNCS (LNBI), vol.\u00a03692, pp. 152\u2013164. Springer, Heidelberg (2005)"},{"key":"7_CR28","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1086\/319501","volume":"68","author":"M. Stephens","year":"2001","unstructured":"Stephens, M., Smith, N.J., Donnelly, P.: A new statistical method for haplotype reconstruction from population data. American J. of Human Genetics\u00a068, 978\u2013989 (2001)","journal-title":"American J. of Human Genetics"},{"issue":"1","key":"7_CR29","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. J. of Computational Biology\u00a08(1), 69\u201378 (2001)","journal-title":"J. of Computational Biology"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11851561_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T23:13:15Z","timestamp":1683587595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11851561_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540395836","9783540395843"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11851561_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}