{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T01:53:26Z","timestamp":1787363606422,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319123394","type":"print"},{"value":"9783319123400","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12340-0_25","type":"book-chapter","created":{"date-parts":[[2014,10,20]],"date-time":"2014-10-20T04:27:23Z","timestamp":1413779243000},"page":"299-311","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Kernelizations for the Hybridization Number Problem on Multiple Nonbinary Trees"],"prefix":"10.1007","author":[{"given":"Leo","family":"van Iersel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steven","family":"Kelk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,10,21]]},"reference":[{"issue":"8","key":"25_CR1","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.tig.2013.05.007","volume":"29","author":"E Bapteste","year":"2013","unstructured":"Bapteste, E., van Iersel, L., Janke, A., Kelchner, S., Kelk, S., McInerney, J.O., Morrison, D.A., Nakhleh, L., Steel, M., Stougie, L., Whitfield, J.: Networks: expanding evolutionary thinking. Trends Genet. 29(8), 439\u2013441 (2013)","journal-title":"Trends Genet."},{"key":"25_CR2","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. Math. Biol. 51, 171\u2013182 (2005)","journal-title":"Math. Biol."},{"issue":"8","key":"25_CR3","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"HL Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423\u2013434 (2009)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"25_CR4","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."},{"issue":"8","key":"25_CR5","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1016\/j.dam.2006.08.008","volume":"155","author":"M Bordewich","year":"2007","unstructured":"Bordewich, M., Semple, C.: Computing the minimum number of hybridization events for a consistent evolutionary history. Discrete Appl. Math. 155(8), 914\u2013928 (2007)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"25_CR6","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":"1","key":"25_CR7","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1089\/cmb.2012.0240","volume":"20","author":"Z-Z Chen","year":"2013","unstructured":"Chen, Z.-Z., Wang, L.: An ultrafast tool for minimum reticulate networks. J. Comput. Biol. 20(1), 38\u201341 (2013)","journal-title":"J. Comput. Biol."},{"key":"25_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)"},{"key":"25_CR9","volume-title":"Phylogenetic Networks: Concepts, Algorithms and Applications","author":"DH Huson","year":"2011","unstructured":"Huson, D.H., Rupp, R., Scornavacca, C.: Phylogenetic Networks: Concepts, Algorithms and Applications. Cambridge University Press, Cambridge (2011)"},{"issue":"5","key":"25_CR10","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1137\/S0097539704446529","volume":"35","author":"J Jansson","year":"2006","unstructured":"Jansson, J., Nguyen, N.B., Sung, W.-K.: Algorithms for combining rooted triplets into a galled phylogenetic network. SIAM J. Comput. 35(5), 1098\u20131121 (2006)","journal-title":"SIAM J. Comput."},{"key":"25_CR11","unstructured":"Kelk, S., Scornavacca, C.: Towards the fixed parameter tractability of constructing minimal phylogenetic networks from arbitrary sets of nonbinary trees (2012). arXiv:1207.7034 [q-bio.PE]"},{"issue":"4","key":"25_CR12","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1007\/s00453-012-9708-5","volume":"68","author":"S Kelk","year":"2014","unstructured":"Kelk, S., Scornavacca, C.: Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable. Algorithmica 68(4), 886\u2013915 (2014)","journal-title":"Algorithmica"},{"issue":"4","key":"25_CR13","doi-asserted-by":"publisher","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.: Cycle killer.. qu\u2019est-ce que c\u2019est? on the comparative approximability of hybridization number and directed feedback vertex set. SIAM J. Discrete Math. 26(4), 1635\u20131656 (2012)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"25_CR14","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/TCBB.2008.86","volume":"6","author":"S Linz","year":"2009","unstructured":"Linz, S., Semple, C.: Hybridization in non-binary trees. IEEE\/ACM Trans. Comput. Biol. Bioinf. 6(1), 30\u201345 (2009)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"25_CR15","volume-title":"Introduction to Phylogenetic Networks","author":"D Morrison","year":"2011","unstructured":"Morrison, D.: Introduction to Phylogenetic Networks. RJR Productions, Uppsala (2011)"},{"issue":"2","key":"25_CR16","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1353\/lan.2005.0078","volume":"81","author":"L Nakhleh","year":"2005","unstructured":"Nakhleh, L., Ringe, D., Warnow, T.: Perfect phylogenetic networks: a new methodology for reconstructing the evolutionary history of natural languages. Language 81(2), 382\u2013420 (2005)","journal-title":"Language"},{"issue":"1","key":"25_CR17","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/TCBB.2012.134","volume":"10","author":"T Piovesan","year":"2013","unstructured":"Piovesan, T., Kelk, S.: A simple fixed parameter tractable algorithm for computing the hybridization number of two (not necessarily binary) trees. IEEE\/ACM Trans. Comput. Biol. Bioinf. 10(1), 18\u201325 (2013)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"25_CR18","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198509424.001.0001","volume-title":"Phylogenetics","author":"C Semple","year":"2003","unstructured":"Semple, C., Steel, M.: Phylogenetics. Oxford University Press, Oxford (2003)"},{"issue":"1","key":"25_CR19","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/120903567","volume":"28","author":"L van Iersel","year":"2014","unstructured":"van Iersel, L., Kelk, S., Leki\u0107, N., Stougie, L.: Approximation algorithms for nonbinary agreement forests. SIAM J. Discrete Math. 28(1), 49\u201366 (2014)","journal-title":"SIAM J. Discrete Math."},{"issue":"9","key":"25_CR20","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":"4","key":"25_CR21","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."},{"key":"25_CR22","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, i140\u2013i148 (2010)","journal-title":"Bioinformatics"},{"issue":"10","key":"25_CR23","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1089\/cmb.2013.0072","volume":"20","author":"W Yufeng","year":"2013","unstructured":"Yufeng, W.: An algorithm for constructing parsimonious hybridization networks with multiple phylogenetic trees. J. Comput. Biol. 20(10), 792\u2013804 (2013)","journal-title":"J. Comput. Biol."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12340-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T03:13:39Z","timestamp":1717470819000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12340-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319123394","9783319123400"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12340-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"21 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}