{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:21:36Z","timestamp":1742383296114},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,1,3]],"date-time":"2008-01-03T00:00:00Z","timestamp":1199318400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s10878-007-9129-6","type":"journal-article","created":{"date-parts":[[2008,1,2]],"date-time":"2008-01-02T15:15:54Z","timestamp":1199286954000},"page":"229-247","source":"Crossref","is-referenced-by-count":3,"title":["A new recombination lower bound and the minimum perfect phylogenetic forest problem"],"prefix":"10.1007","volume":"16","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","published-online":{"date-parts":[[2008,1,3]]},"reference":[{"key":"9129_CR1","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/TCBB.2004.23","volume":"1","author":"V Bafna","year":"2004","unstructured":"Bafna V, Bansal V (2004) The number of recombination events in a sample history: conflict graph and lower bounds. IEEE\/ACM Trans Comput Biol Bioinf 1:78\u201390","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"key":"9129_CR2","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1089\/cmb.2006.13.501","volume":"13","author":"V Bafna","year":"2006","unstructured":"Bafna V, Bansal V (2006) Inference about recombination from haplotype data: lower bounds and recombination hotspots. J Comput Biol 13:501\u2013521","journal-title":"J Comput Biol"},{"key":"9129_CR3","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s00026-004-0229-z","volume":"8","author":"M Bordewich","year":"2004","unstructured":"Bordewich M, Semple C (2004) On the computational complexity of the rooted subtree prune and regraft distance. Ann Comb 8:409\u2013423","journal-title":"Ann Comb"},{"key":"9129_CR4","doi-asserted-by":"crossref","unstructured":"Foulds LR, Graham RL (1982) The Steiner tree in phylogeny is NP-complete. Adv Appl Math 3","DOI":"10.1016\/S0196-8858(82)80004-3"},{"key":"9129_CR5","volume-title":"Computers and intractability","author":"M Garey","year":"1979","unstructured":"Garey M, Johnson D (1979) Computers and intractability. Freeman, San Francisco"},{"key":"9129_CR6","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1089\/cmb.1996.3.479","volume":"3","author":"RC Griffiths","year":"1996","unstructured":"Griffiths RC, Marjoram P (1996) Ancestral inference from samples of DNA sequences with recombination. J Comput Biol 3:479\u2013502","journal-title":"J Comput Biol"},{"key":"9129_CR7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.3230210104","volume":"21","author":"D Gusfield","year":"1991","unstructured":"Gusfield D (1991) Efficient algorithms for inferring evolutionary history. Networks 21:19\u201328","journal-title":"Networks"},{"key":"9129_CR8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1142\/S0219720004000521","volume":"2","author":"D Gusfield","year":"2004","unstructured":"Gusfield D, Eddhu S, Langley C (2004) Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. J Bioinf Comput Biol 2:173\u2013213","journal-title":"J Bioinf Comput Biol"},{"key":"9129_CR9","doi-asserted-by":"crossref","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 (2007) An efficiently-computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study. Discrete Appl Math 155:806\u2013830","journal-title":"Discrete Appl Math"},{"issue":"2","key":"9129_CR10","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1093\/bioinformatics\/18.2.337","volume":"18","author":"R Hudson","year":"2002","unstructured":"Hudson R (2002) Generating samples under the Wright-Fisher neutral model of genetic variation. Bioinformatics 18(2):337\u2013338","journal-title":"Bioinformatics"},{"key":"9129_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 (1985) Statistical properties of the number of recombination events in the history of a sample of DNA sequences. Genetics 111:147\u2013164","journal-title":"Genetics"},{"key":"9129_CR12","unstructured":"Myers S (2003) The detection of recombination events using DNA sequence data. PhD dissertation, Dept of Statistics, University of Oxford, Oxford, England"},{"key":"9129_CR13","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1093\/genetics\/163.1.375","volume":"163","author":"SR Myers","year":"2003","unstructured":"Myers SR, Griffiths RC (2003) Bounds on the minimum number of recombination events in a sample history. Genetics 163:375\u2013394","journal-title":"Genetics"},{"key":"9129_CR14","doi-asserted-by":"crossref","unstructured":"Song YS, Ding Z, Gusfield D, Langley C, Wu Y (2006) Algorithms to distinguish the role of gene-conversion from single-crossover recombination in the derivations of SNP sequences in populations. In: Proceedings of RECOMB 2006. LNBI, vol\u00a03909","DOI":"10.1007\/11732990_20"},{"key":"9129_CR15","doi-asserted-by":"crossref","first-page":"i413","DOI":"10.1093\/bioinformatics\/bti1033","volume":"421","author":"YS Song","year":"2005","unstructured":"Song YS, Wu Y, Gusfield D (2005) Efficient computation of close lower and upper bounds on the minimum number of needed recombinations in the evolution of biological sequences. Bioinformatics 421:i413\u2013i422. Proceedings of ISMB 2005","journal-title":"Bioinformatics"},{"key":"9129_CR16","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1089\/106652701300099119","volume":"8","author":"L Wang","year":"2001","unstructured":"Wang L, Zhang K, Zhang L (2001) Perfect phylogenetic networks with recombination. J Comput Biol 8:69\u201378","journal-title":"J Comput Biol"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9129-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9129-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9129-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T16:08:19Z","timestamp":1630426099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9129-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,3]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["9129"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9129-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,3]]}}}