{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,11]],"date-time":"2026-09-11T16:17:34Z","timestamp":1789143454599,"version":"build-2803163510"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2013,8,8]],"date-time":"2013-08-08T00:00:00Z","timestamp":1375920000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Bull Math Biol"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s11538-013-9874-x","type":"journal-article","created":{"date-parts":[[2013,8,7]],"date-time":"2013-08-07T19:45:57Z","timestamp":1375904757000},"page":"1879-1890","source":"Crossref","is-referenced-by-count":21,"title":["Cherry Picking: A Characterization of the Temporal Hybridization Number for a Set of Phylogenies"],"prefix":"10.1007","volume":"75","author":[{"given":"Peter J.","family":"Humphries","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simone","family":"Linz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Charles","family":"Semple","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,8,8]]},"reference":[{"key":"9874_CR1","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1089\/cmb.2012.0192","volume":"19","author":"B. Albrecht","year":"2012","unstructured":"Albrecht, B., Linz, C., & Scornavacca, C. (2012). A\u00a0first step toward computing all hybridization networks for two rooted binary phylogenetic trees. J.\u00a0Comput. Biol., 19, 1227\u20131242.","journal-title":"J.\u00a0Comput. Biol."},{"key":"9874_CR2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s00285-005-0315-9","volume":"51","author":"M. Baroni","year":"2005","unstructured":"Baroni, M., Gr\u00fcnewald, S., Moulton, V., & Semple, C. (2005). Bounding the number of hybridization events for a consistent evolutionary history. J.\u00a0Math. Biol., 51, 171\u2013182.","journal-title":"J.\u00a0Math. Biol."},{"key":"9874_CR3","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1080\/10635150500431197","volume":"44","author":"M. Baroni","year":"2006","unstructured":"Baroni, M., Semple, C., & Steel, M. (2006). Hybrids in real time. Syst. Biol., 44, 46\u201356.","journal-title":"Syst. Biol."},{"key":"9874_CR4","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1109\/tcbb.2007.1019","volume":"4","author":"M. Bordewich","year":"2007","unstructured":"Bordewich, M., & Semple, C. (2007). Computing the hybridization number of two phylogenetic trees is fixed-parameter tractable. IEEE\/ACM Trans. Comput. Biol. Bioinform., 4, 458\u2013466.","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"9874_CR5","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1177\/117693430700300017","volume":"3","author":"M. Bordewich","year":"2007","unstructured":"Bordewich, M., Linz, S., John, K. St., & Semple, C. (2007). A reduction algorithm for computing the hybridization number of two trees. Evol. Bioinform., 3, 86\u201398.","journal-title":"Evol. Bioinform."},{"key":"9874_CR6","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1109\/TCBB.2007.70270","volume":"6","author":"G. Cardona","year":"2009","unstructured":"Cardona, G., Rossello, F., & Valiente, G. (2009). Comparison of tree-child phylogenetic networks. IEEE\/ACM Trans. Comput. Biol. Bioinform., 6, 552\u2013569.","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"9874_CR7","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/TCBB.2011.137","volume":"9","author":"Z. Z. Chen","year":"2012","unstructured":"Chen, Z. Z., & Wang, L. (2012). Algorithms for reticulate networks of multiple phylogenetic trees. IEEE\/ACM Trans. Comput. Biol. Bioinform., 9, 372\u2013384.","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"9874_CR8","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1089\/cmb.2012.0240","volume":"20","author":"Z. Z. Chen","year":"2013","unstructured":"Chen, Z. Z., & Wang, L. (2013). An ultrafast tool for minimum reticulate networks. J.\u00a0Comput. Biol., 20, 38\u201341.","journal-title":"J.\u00a0Comput. Biol."},{"key":"9874_CR9","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1089\/cmb.2009.0166","volume":"18","author":"J. Collins","year":"2011","unstructured":"Collins, J., Linz, S., & Semple, C. (2011). Quantifying hybridization in realistic time. J. Comput. Biol., 18, 1305\u20131318.","journal-title":"J. Comput. Biol."},{"key":"9874_CR10","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1016\/S0022-0000(03)00077-1","volume":"67","author":"J. Gramm","year":"2003","unstructured":"Gramm, J., & Niedermeier, R. (2003). A\u00a0fixed-parameter algorithm for minimum quartet inconsistency. J.\u00a0Comput. Syst. Sci., 67, 723\u2013741.","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"9874_CR11","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1093\/comjnl\/bxm049","volume":"51","author":"J. Gramm","year":"2008","unstructured":"Gramm, J., Nickelsen, A., & Tantau, T. (2008). Fixed-parameter algorithms in phylogenetics. Comput. J., 51, 79\u2013101.","journal-title":"Comput. J."},{"issue":"7\u20138","key":"9874_CR12","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1016\/j.dam.2012.11.022","volume":"161","author":"P. J. Humphries","year":"2013","unstructured":"Humphries, P. J., Linz, S., & Semple, C. (2013). On the complexity of computing the temporal hybridization number for two phylogenies. Discrete Appl. Math., 161(7\u20138), 871\u2013880.","journal-title":"Discrete Appl. Math."},{"key":"9874_CR13","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1093\/gbe\/evq077","volume":"3","author":"D. H. Huson","year":"2011","unstructured":"Huson, D. H., & Scornavacca, C. (2011). A\u00a0survey of combinatorial methods for phylogenetic networks. Genome Biol. Evol., 3, 23\u201335.","journal-title":"Genome Biol. Evol."},{"key":"9874_CR14","doi-asserted-by":"crossref","first-page":"1635","DOI":"10.1137\/120864350","volume":"26","author":"S. Kelk","year":"2012","unstructured":"Kelk, S., van Iersel, L., Leki\u0107, N., Linz, S., Scornavacca, C., & Stougie, L. (2012). Cycle killer\u2026qu\u2019est-ce que c\u2019est? On the comparative approximability of hybridization number and directed feedback vertex set. SIAM J. Discrete Math., 26, 1635\u20131656.","journal-title":"SIAM J. Discrete Math."},{"key":"9874_CR15","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1007\/s00285-009-0319-y","volume":"61","author":"S. Linz","year":"2010","unstructured":"Linz, S., Semple, C., & Stadler, T. (2010). Analyzing and reconstructing reticulation networks under timing constraints. J. Math. Biol., 61, 715\u2013735.","journal-title":"J. Math. Biol."},{"key":"9874_CR16","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/TCBB.2012.134","volume":"10","author":"T. Piovesan","year":"2013","unstructured":"Piovesan, T., & Kelk, S. (2013). A\u00a0simple fixed parameter tractable algorithm for computing the hybridization number of two (not necessarily binary) trees. IEEE\/ACM Trans. Comput. Biol. Bioinform., 10, 18\u201325.","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"9874_CR17","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.jtbi.2010.10.032","volume":"269","author":"L. Iersel van","year":"2011","unstructured":"van Iersel, L., & Kelk, S. (2011). When two trees go to war. J. Theor. Biol., 269, 245\u2013255.","journal-title":"J. Theor. Biol."},{"issue":"4","key":"9874_CR18","doi-asserted-by":"crossref","first-page":"1431","DOI":"10.1137\/110845045","volume":"42","author":"C. Whidden","year":"2013","unstructured":"Whidden, C., Beiko, R. G., & Zeh, N. (2013). Fixed-parameter and approximation algorithms for maximum agreement forests. SIAM J. Comput. 42(4), 1431\u20131466.","journal-title":"SIAM J. Comput."},{"key":"9874_CR19","doi-asserted-by":"crossref","first-page":"i140","DOI":"10.1093\/bioinformatics\/btq198","volume":"26","author":"Y. Wu","year":"2010","unstructured":"Wu, Y. (2010). Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees. Bioinformatics, 26, i140\u2013i148.","journal-title":"Bioinformatics"},{"key":"9874_CR20","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/978-3-642-13078-6_23","volume-title":"Proceedings of the International Symposium on Bioinformatics Research and Applications","author":"Y. Wu","year":"2010","unstructured":"Wu, Y., & Wang, J. (2010). Fast computation of the exact hybridization number of two phylogenetic trees. In LNCS: Vol.\u00a06053. Proceedings of the International Symposium on Bioinformatics Research and Applications (pp.\u00a0203\u2013214)."}],"container-title":["Bulletin of Mathematical Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11538-013-9874-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11538-013-9874-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11538-013-9874-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T14:53:10Z","timestamp":1563634390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11538-013-9874-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,8]]},"references-count":20,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9874"],"URL":"https:\/\/doi.org\/10.1007\/s11538-013-9874-x","relation":{},"ISSN":["0092-8240","1522-9602"],"issn-type":[{"value":"0092-8240","type":"print"},{"value":"1522-9602","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,8]]}}}