{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T21:17:43Z","timestamp":1771103863679,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,2,15]],"date-time":"2022-02-15T00:00:00Z","timestamp":1644883200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,15]],"date-time":"2022-02-15T00:00:00Z","timestamp":1644883200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"crossref","award":["RGPIN\/05435-2018"],"award-info":[{"award-number":["RGPIN\/05435-2018"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s00453-021-00914-8","type":"journal-article","created":{"date-parts":[[2022,2,15]],"date-time":"2022-02-15T18:05:11Z","timestamp":1644948311000},"page":"917-960","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees"],"prefix":"10.1007","volume":"84","author":[{"given":"Leo","family":"van Iersel","sequence":"first","affiliation":[]},{"given":"Remie","family":"Janssen","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Jones","sequence":"additional","affiliation":[]},{"given":"Yukihiro","family":"Murakami","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0562-1629","authenticated-orcid":false,"given":"Norbert","family":"Zeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,15]]},"reference":[{"key":"914_CR1","doi-asserted-by":"crossref","unstructured":"Albrecht, B.: Computing hybridization networks for multiple rooted binary phylogenetic trees by maximum acyclic agreement forests. arXiv:1408.3044 (2014)","DOI":"10.1186\/s12859-015-0660-7"},{"issue":"1","key":"914_CR2","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1186\/s12859-015-0660-7","volume":"16","author":"B Albrecht","year":"2015","unstructured":"Albrecht, B.: Computing all hybridization networks for multiple binary phylogenetic input trees. BMC Bioinf 16(1), 236 (2015)","journal-title":"BMC Bioinf"},{"issue":"2","key":"914_CR3","doi-asserted-by":"publisher","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.: Bounding the number of hybridisation events for a consistent evolutionary history. J. Math. Biol. 51(2), 171\u2013182 (2005)","journal-title":"J. Math. Biol."},{"key":"914_CR4","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1080\/10635150500431197","volume":"55","author":"M Baroni","year":"2006","unstructured":"Baroni, M., Semple, C., Steel, M.: Hybrids in real time. Syst. Biol. 55, 46\u201356 (2006)","journal-title":"Syst. Biol."},{"issue":"1","key":"914_CR5","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1186\/1745-6150-6-34","volume":"6","author":"RG Beiko","year":"2011","unstructured":"Beiko, R.G.: Telling the whole story in a 10,000-genome world. Biol. Direct 6(1), 34 (2011)","journal-title":"Biol. Direct"},{"issue":"3","key":"914_CR6","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1109\/tcbb.2007.1019","volume":"4","author":"M Bordewich","year":"2007","unstructured":"Bordewich, M., Semple, C.: Computing the hybridization number of two phylogenetic trees is fixed-parameter tractable. IEEE\/ACM Trans. Comput. Biol. Bioinf. 4(3), 458\u2013466 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"914_CR7","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1177\/117693430700300017","volume":"3","author":"M Bordewich","year":"2007","unstructured":"Bordewich, M., Linz, S., John, K.S., Semple, C.: A reduction algorithm for computing the hybridization number of two trees. Evol. Bioinf. Online 3, 86\u201398 (2007)","journal-title":"Evol. Bioinf. Online"},{"key":"914_CR8","unstructured":"Borst, S.: New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees. Master\u2019s thesis, TU Delft, the Netherlands (2020)"},{"issue":"2","key":"914_CR9","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/TCBB.2011.137","volume":"9","author":"Z-Z Chen","year":"2012","unstructured":"Chen, Z.-Z., Wang, L.: Algorithms for reticulate networks of multiple phylogenetic trees. IEEE\/ACM Trans. Comput. Biol. Bioinf. 9(2), 372\u2013384 (2012)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"10","key":"914_CR10","doi-asserted-by":"publisher","first-page":"1879","DOI":"10.1007\/s11538-013-9874-x","volume":"75","author":"PJ Humphries","year":"2013","unstructured":"Humphries, P.J., Linz, S., Semple, C.: Cherry picking: a characterization of the temporal hybridization number for a set of phylogenies. Bull. Math. Biol. 75(10), 1879\u20131890 (2013)","journal-title":"Bull. Math. Biol."},{"key":"914_CR11","unstructured":"Kelk, S.: Treetistic. http:\/\/skelk.sdf-eu.org\/clustistic\/, (2012)"},{"key":"914_CR12","unstructured":"Li, Z., Zeh, N.: Computing maximum agreement forests without cluster partitioning is folly. In: Proceedings of the 25th Annual European Symposium on Algorithms, pp. 56:1\u201356:14 (2017)"},{"issue":"3","key":"914_CR13","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s00026-011-0108-3","volume":"15","author":"S Linz","year":"2011","unstructured":"Linz, S., Semple, C.: A cluster reduction for computing the subtree distance between phylogenies. Ann. Comb. 15(3), 465\u2013484 (2011)","journal-title":"Ann. Comb."},{"key":"914_CR14","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.aam.2019.01.004","volume":"105","author":"S Linz","year":"2019","unstructured":"Linz, S., Semple, C.: Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies. Adv. Appl. Math. 105, 102\u2013129 (2019)","journal-title":"Adv. Appl. Math."},{"issue":"3","key":"914_CR15","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1109\/TCBB.2015.2462336","volume":"13","author":"S Mirzaei","year":"2016","unstructured":"Mirzaei, S., Yufeng, W.: Fast construction of near parsimonious hybridization networks for multiple phylogenetic trees. IEEE\/ACM Trans. Comput. Biol. Bioinf. 13(3), 565\u2013570 (2016)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"9","key":"914_CR16","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.ipl.2013.02.010","volume":"113","author":"L van Iersel","year":"2013","unstructured":"van Iersel, L., Linz, S.: A quadratic kernel for computing the hybridization number of multiple trees. Inf. Process. Lett. 113(9), 318\u2013323 (2013)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"914_CR17","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1137\/15M1036579","volume":"30","author":"L van Iersel","year":"2016","unstructured":"van Iersel, L., Kelk, S., Lekic, N., Whidden, C., Zeh, N.: Hybridization number on three rooted binary trees is EPT. SIAM J. Discret. Math. 30(3), 1607\u20131631 (2016)","journal-title":"SIAM J. Discret. Math."},{"issue":"6","key":"914_CR18","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1016\/j.jcss.2016.03.006","volume":"82","author":"L van Iersel","year":"2016","unstructured":"van Iersel, L., Kelk, S., Scornavacca, C.: Kernelizations for the hybridization number problem on multiple nonbinary trees. J. Comput. Syst. Sci. 82(6), 1075\u20131089 (2016)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"914_CR19","doi-asserted-by":"publisher","first-page":"1431","DOI":"10.1137\/110845045","volume":"42","author":"C Whidden","year":"2013","unstructured":"Whidden, C., Beiko, R.G., Zeh, N.: Fixed-parameter algorithms for maximum agreement forests. SIAM J. Comput. 42(4), 1431\u20131466 (2013)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"914_CR20","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1093\/sysbio\/syu023","volume":"63","author":"C Whidden","year":"2014","unstructured":"Whidden, C., Zeh, N., Beiko, R.G.: Supertrees based on the subtree prune-and-regraft distance. Syst. Biol. 63(4), 566\u2013581 (2014)","journal-title":"Syst. Biol."},{"issue":"12","key":"914_CR21","doi-asserted-by":"publisher","first-page":"i140","DOI":"10.1093\/bioinformatics\/btq198","volume":"26","author":"W Yufeng","year":"2010","unstructured":"Yufeng, W.: Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees. Bioinformatics 26(12), i140\u2013i148 (2010)","journal-title":"Bioinformatics"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00914-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-021-00914-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00914-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T15:09:29Z","timestamp":1647443369000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-021-00914-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,15]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["914"],"URL":"https:\/\/doi.org\/10.1007\/s00453-021-00914-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,15]]},"assertion":[{"value":"19 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}