{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:36Z","timestamp":1725489156681},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735441"},{"type":"electronic","value":"9783540735458"}],"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-73545-8_5","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T13:44:11Z","timestamp":1187358251000},"page":"16-26","source":"Crossref","is-referenced-by-count":2,"title":["A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem"],"prefix":"10.1007","author":[{"given":"Yufeng","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Gusfield","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/TCBB.2004.23","volume":"1","author":"V. Bafna","year":"2004","unstructured":"Bafna, V., Bansal, V.: The number of recombination events in a sample history: conflict graph and lower bounds. IEEE\/ACM Trans. on Computational Biology and Bioinformatics\u00a01, 78\u201390 (2004)","journal-title":"IEEE\/ACM Trans. on Computational Biology and Bioinformatics"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1089\/cmb.2006.13.501","volume":"13","author":"V. Bafna","year":"2006","unstructured":"Bafna, V., Bansal, V.: Inference about Recombination from Haplotype Data: Lower Bounds and Recombination Hotspots. J. of Comp. Bio.\u00a013, 501\u2013521 (2006)","journal-title":"J. of Comp. Bio."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s00026-004-0229-z","volume":"8","author":"M. Bordewich","year":"2004","unstructured":"Bordewich, M., Semple, C.: On the computational complexity of the rooted subtree prune and regraft distance. Annals of Combinatorics\u00a08, 409\u2013423 (2004)","journal-title":"Annals of Combinatorics"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Foulds, L.R., Graham, R.L.: The Steiner Tree in Phylogeny is NP-complete, Advances in Applied Math. 3 (1982)","DOI":"10.1016\/S0196-8858(82)80004-3"},{"key":"5_CR5","unstructured":"Garey, M., Johnson, D.: Computers and intractability, Freeman (1979)"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1089\/cmb.1996.3.479","volume":"3","author":"R.C. Griffiths","year":"1996","unstructured":"Griffiths, R.C., Marjoram, P.: Ancestral inference from samples of DNA sequences with recombination. J. of Comp. Bio.\u00a03, 479\u2013502 (1996)","journal-title":"J. of Comp. Bio."},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/net.3230210104","volume":"21","author":"D. Gusfield","year":"1991","unstructured":"Gusfield, D.: Efficient algorithms for inferring evolutionary history. Networks\u00a021, 19\u201328 (1991)","journal-title":"Networks"},{"key":"5_CR8","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. Bioinformatics and Computational Biology\u00a02, 173\u2013213 (2004)","journal-title":"J. Bioinformatics and Computational Biology"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1016\/j.dam.2005.05.044","volume":"155","author":"D. Gusfield","year":"2007","unstructured":"Gusfield, D., Hickerson, D., Eddhu, S.: An Efficiently-Computed Lower Bound on the Number of Recombinations in Phylogenetic Networks: Theory and Empirical Study. Discrete Applied Math.\u00a0155, 806\u2013830 (2007)","journal-title":"Discrete Applied Math."},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1093\/bioinformatics\/18.2.337","volume":"18","author":"R. Hudson","year":"2002","unstructured":"Hudson, R.: Generating Samples under the Wright-Fisher neutral model of genetic variation. Bioinformatics\u00a018(2), 337\u2013338 (2002)","journal-title":"Bioinformatics"},{"key":"5_CR11","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1093\/genetics\/111.1.147","volume":"111","author":"R. Hudson","year":"1985","unstructured":"Hudson, R., Kaplan, N.: 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":"5_CR12","unstructured":"Myers, S.: The detection of recombination events using DNA sequence data, PhD dissertation. Dept. of Statistics, University of Oxford, Oxford, England (2003)"},{"key":"5_CR13","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":"5_CR14","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","DOI":"10.1007\/11732990_20","volume-title":"Research in Computational Molecular Biology","author":"Y.S. Song","year":"2006","unstructured":"Song, Y.S., Ding, Z., Gusfield, D., Langley, C., Wu, Y.: Algorithms to distinguish the role of gene-conversion from single-crossover recombination in the derivations of SNP sequences in populations. In: Apostolico, A., Guerra, C., Istrail, S., Pevzner, P., Waterman, M. (eds.) RECOMB 2006. LNCS (LNBI), vol.\u00a03909, Springer, Heidelberg (2006)"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1093\/bioinformatics\/bti1033","volume":"421","author":"Y.S. Song","year":"2005","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\u00a0421, i413\u2013i422 (2005) Proceedings of ISMB 2005","journal-title":"Bioinformatics"},{"key":"5_CR16","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 Comp. Bio.\u00a08, 69\u201378 (2001)","journal-title":"J. of Comp. Bio."}],"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-73545-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T23:49:48Z","timestamp":1629589788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73545-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540735441","9783540735458"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73545-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}