{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T17:09:04Z","timestamp":1783530544034,"version":"3.55.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1186\/1471-2105-15-127","type":"journal-article","created":{"date-parts":[[2014,5,5]],"date-time":"2014-05-05T11:35:36Z","timestamp":1399289736000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees"],"prefix":"10.1186","volume":"15","author":[{"given":"Leo van","family":"Iersel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steven","family":"Kelk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nela","family":"Leki\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Celine","family":"Scornavacca","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,5,5]]},"reference":[{"key":"6387_CR1","volume-title":"Mathematics of Evolution and Phylogeny","year":"2005","unstructured":"Gascuel O, (ed.): Mathematics of Evolution and Phylogeny. 2005, UK: Oxford University Press Inc."},{"key":"6387_CR2","volume-title":"Reconstructing Evolution: New Mathematical and Computational Advances","year":"2007","unstructured":"Gascuel O, Steel M, (eds.): Reconstructing Evolution: New Mathematical and Computational Advances. 2007, UK: Oxford University Press"},{"issue":"8","key":"6387_CR3","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 LJJ, Janke A, Kelchner S, Kelk SM, McInerney JO, Morrison DA, Nakhleh L, Steel M, Stougie L, Whitfield J: Networks: expanding evolutionary thinking. Trends Genet. 2013, 29 (8): 439-441. 10.1016\/j.tig.2013.05.007.","journal-title":"Trends Genet"},{"key":"6387_CR4","volume-title":"Phylogenetic Networks: Concepts, Algorithms and Applications","author":"DH Huson","year":"2011","unstructured":"Huson DH, Rupp R, Scornavacca C: Phylogenetic Networks: Concepts, Algorithms and Applications. 2011, UK: Cambridge University Press,"},{"key":"6387_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1093\/gbe\/evq077","volume":"3","author":"DH Huson","year":"2011","unstructured":"Huson DH, Scornavacca C: A survey of combinatorial methods for phylogenetic networks. Genome Biol Evol. 2011, 3: 23-35. 10.1093\/gbe\/evq077.","journal-title":"Genome Biol Evol"},{"key":"6387_CR6","volume-title":"The Problem Solving Handbook for Computational Biology and Bioinformatics","author":"L Nakhleh","year":"2009","unstructured":"Nakhleh L: Evolutionary phylogenetic networks: models and issues. The Problem Solving Handbook for Computational Biology and Bioinformatics. Edited by: Heath L, Ramakrishnan N. 2009, Berlin: Springer,"},{"issue":"8","key":"6387_CR7","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. 2007, 155 (8): 914-928. 10.1016\/j.dam.2006.08.008.","journal-title":"Discrete Appl Math"},{"key":"6387_CR8","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum J, Grohe M: Parameterized Complexity Theory. 2006, Berlin: Springer"},{"key":"6387_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity (Monographs in Computer Science)","author":"RG Downey","year":"1999","unstructured":"Downey RG, Fellows MR: Parameterized Complexity (Monographs in Computer Science). 1999, Berlin: Springer"},{"key":"6387_CR10","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1177\/117693430700300017","volume":"3","author":"M Bordewich","year":"2007","unstructured":"Bordewich M, Linz S, John KS, Semple C: A reduction algorithm for computing the hybridization number of two trees. Evol Bioinform. 2007, 3: 86-98.","journal-title":"Evol Bioinform"},{"issue":"22","key":"6387_CR11","doi-asserted-by":"publisher","first-page":"2912","DOI":"10.1093\/bioinformatics\/btq548","volume":"26","author":"Z-Z Chen","year":"2010","unstructured":"Chen Z-Z, Wang L: Hybridnet: a tool for constructing hybridization networks. Bioinformatics. 2010, 26 (22): 2912-2913. 10.1093\/bioinformatics\/btq548.","journal-title":"Bioinformatics"},{"key":"6387_CR12","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1089\/cmb.2009.0166","volume":"18","author":"J Collins","year":"2011","unstructured":"Collins J, Linz S, Semple C: Quantifying hybridization in realistic time. J Comp Biol. 2011, 18: 1305-1318. 10.1089\/cmb.2009.0166.","journal-title":"J Comp Biol"},{"key":"6387_CR13","doi-asserted-by":"crossref","unstructured":"Whidden C, Beiko RG, Zeh N: Fixed-parameter algorithms for maximum agreement forests. SIAM J Comput. 42 (4): 1431-1466.","DOI":"10.1137\/110845045"},{"issue":"6","key":"6387_CR14","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1093\/sysbio\/sys062","volume":"61","author":"DH Huson","year":"2012","unstructured":"Huson DH, Scornavacca C: Dendroscope 3: An interactive tool for rooted phylogenetic trees and networks. Syst Biol. 2012, 61 (6): 1061-1067. 10.1093\/sysbio\/sys062.","journal-title":"Syst Biol"},{"issue":"2","key":"6387_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1093\/bioinformatics\/btr618","volume":"28","author":"B Albrecht","year":"2012","unstructured":"Albrecht B, Scornavacca C, Cenci A, Huson DH: Fast computation of minimum hybridization networks. Bioinformatics. 2012, 28 (2): 191-197. 10.1093\/bioinformatics\/btr618.","journal-title":"Bioinformatics"},{"issue":"2","key":"6387_CR16","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. 2012, 9 (2): 372-384.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"issue":"1","key":"6387_CR17","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. 2013, 20 (1): 38-41. 10.1089\/cmb.2012.0240.","journal-title":"J Comput Biol"},{"issue":"1","key":"6387_CR18","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. 2013, 10 (1): 18-25.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"issue":"1","key":"6387_CR19","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. 2009, 6 (1): 30-45.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"issue":"4","key":"6387_CR20","doi-asserted-by":"publisher","first-page":"1635","DOI":"10.1137\/120864350","volume":"26","author":"SM Kelk","year":"2012","unstructured":"Kelk SM, van Iersel LJJ, Lekic 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 Discr Math. 2012, 26 (4): 1635-1656. 10.1137\/120864350.","journal-title":"SIAM J Discr Math"},{"issue":"1","key":"6387_CR21","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/120903567","volume":"28","author":"LJJ van Iersel","year":"2014","unstructured":"van Iersel LJJ, Kelk SM, Stougie L, Leki\u0107 N: Approximation algorithms for nonbinary agreement forests. SIAM J Discrete Math. 2014, 28 (1): 49-66. 10.1137\/120903567.","journal-title":"SIAM J Discrete Math"},{"key":"6387_CR22","unstructured":"Whidden C: rSPR. http:\/\/kiwi.cs.dal.ca\/Software\/RSPR ,"},{"key":"6387_CR23","doi-asserted-by":"crossref","unstructured":"Whidden C, Beiko RG, Zeh N: Fast FPT algorithms for computing rooted agreement forests: Theory and experiments. Proceedings of the 9th International Symposium on Experimental Algorithms (SEA). Lect Notes Comput Sc, vol. 6049, pp. 141\u2013153 SpringerL: Berlin; 2010,","DOI":"10.1007\/978-3-642-13193-6_13"},{"key":"6387_CR24","unstructured":"Whidden C, Beiko RG, Zeh N: Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests of Multifurcating Trees. ArXiv preprint: http:\/\/arxiv.org\/abs\/1305.0512 (2013),"},{"key":"6387_CR25","unstructured":"Kelk SM: CYCLEKILLER. http:\/\/skelk.sdf-eu.org\/cyclekiller ,"},{"key":"6387_CR26","unstructured":"van Iersel LJJ: NONBINARYCYCLEKILLER. http:\/\/homepages.cwi.nl\/~iersel\/cyclekiller ,"},{"key":"6387_CR27","unstructured":"Kelk SM: TERMINUSEST. http:\/\/skelk.sdf-eu.org\/terminusest ,"},{"key":"6387_CR28","volume-title":"Algorithms in Bioinformatics. Lect Notes Comput Sc, vol. 7534, pp. 430\u2013440.","author":"LJJ van Iersel","year":"2012","unstructured":"van Iersel LJJ, Kelk SM, Lekic N, Scornavacca C: A practical approximation algorithm for solving massive instances of hybridization number. Algorithms in Bioinformatics. Lect Notes Comput Sc, vol. 7534, pp. 430\u2013440.Edited by: Raphael B, Tang J. 2012, Berlin: Springer,"},{"key":"6387_CR29","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. 2005, 51: 171-182. 10.1007\/s00285-005-0315-9.","journal-title":"J Math Biol"},{"key":"6387_CR30","volume-title":"Nucleic Acids Res","author":"M Rouard","year":"2010","unstructured":"Rouard M, Guignon V, Aluome C, Laporte M-A, Droc G, Walde C, Zmasek CM, P\u00e9rin C, Conte MG: Greenphyldb v2.0: comparative and functional genomics in plants. Nucleic Acids Res. 2010, doi:10.1093\/nar\/gkq811. Epub 2010 Sep 22,"},{"issue":"3","key":"6387_CR31","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1016\/j.ic.2010.11.022","volume":"209","author":"C Scornavacca","year":"2011","unstructured":"Scornavacca C, Berry V, Ranwez V: Building species trees from larger parts of phylogenomic databases. Inform Comput. 2011, 209 (3): 590-605. 10.1016\/j.ic.2010.11.022.","journal-title":"Inform Comput"},{"key":"6387_CR32","unstructured":"Scornavacca C: SSIMUL. http:\/\/www.atgc-montpellier.fr\/ssimul\/ ,"},{"issue":"2","key":"6387_CR33","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/PL00009191","volume":"20","author":"G Even","year":"1998","unstructured":"Even G, Naor J, Schieber B, Sudan M: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica. 1998, 20 (2): 151-174. 10.1007\/PL00009191.","journal-title":"Algorithmica"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-15-127.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T04:06:43Z","timestamp":1565410003000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-15-127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,5]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["6387"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-15-127","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,5]]},"assertion":[{"value":"2 December 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2014","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2014","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"127"}}