{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T21:54:58Z","timestamp":1723672498264},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,7,30]],"date-time":"2015-07-30T00:00:00Z","timestamp":1438214400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1186\/s12859-015-0660-7","type":"journal-article","created":{"date-parts":[[2015,7,29]],"date-time":"2015-07-29T04:50:40Z","timestamp":1438145440000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Computing all hybridization networks for multiple binary phylogenetic input trees"],"prefix":"10.1186","volume":"16","author":[{"given":"Benjamin","family":"Albrecht","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,30]]},"reference":[{"key":"660_CR1","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1038\/nature05706","volume":"446","author":"J Mallet","year":"2007","unstructured":"Mallet J. Hybrid speciation. Nature. 2007; 446:279\u201383.","journal-title":"Nature"},{"key":"660_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1023\/A:1006340407546","volume":"42","author":"LH Rieseberg","year":"2000","unstructured":"Rieseberg LH. Hybridization, introgression, and linkage evolution. Plant Mol Biol. 2000; 42:205\u201324.","journal-title":"Plant Mol Biol."},{"key":"660_CR3","first-page":"561","volume":"60","author":"P Soltis","year":"2009","unstructured":"Soltis P, Soltis D. The role of hybridization in plant speciation. J Comput Biol. 2009; 60:561\u201388.","journal-title":"J Comput Biol."},{"issue":"1505","key":"660_CR4","doi-asserted-by":"publisher","first-page":"2805","DOI":"10.1098\/rstb.2008.0055","volume":"363","author":"K Schwenk","year":"2008","unstructured":"Schwenk K, Brede N, Streitl B. Introduction. extent, processes and evolutionary impact of interspecific hybridization in animals. Phil Trans R Soc B Biol Sci. 2008; 363(1505):2805\u2013811.","journal-title":"Phil Trans R Soc B Biol Sci."},{"key":"660_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. 2007; 155:914\u201328.","journal-title":"Discrete Appl Math."},{"issue":"9","key":"660_CR6","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. Inform Process Lett. 2013; 113(9):318\u201323.","journal-title":"Inform Process Lett."},{"issue":"12","key":"660_CR7","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1093\/bioinformatics\/btq198","volume":"26","author":"Y Wu","year":"2009","unstructured":"Wu Y. Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees. Bioinformatics. 2009; 26(12):140\u20138.","journal-title":"Bioinformatics"},{"issue":"10","key":"660_CR8","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1089\/cmb.2013.0072","volume":"20","author":"Y Wu","year":"2013","unstructured":"Wu Y. An algorithm for constructing parsimonious hybridization networks with multiple phylogenetic trees. J Comput Biol. 2013; 20(10):792\u2013804.","journal-title":"J Comput Biol."},{"issue":"2","key":"660_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1093\/bioinformatics\/btr618","volume":"28","author":"B Albrecht","year":"2011","unstructured":"Albrecht B, Scornavacca C, Cenci C, Huson DH. Fast computation of minimum hybridization networks. Bioinformatics. 2011; 28(2):191\u20137.","journal-title":"Bioinformatics"},{"issue":"1","key":"660_CR10","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-runtime. Syst Biol. 2006; 55(1):46\u201356.","journal-title":"Syst Biol."},{"key":"660_CR11","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 tress is fixed-parameter traceable. IEEE\/ACM Trans Comput Biol Bioinformatics. 2007; 4:458\u201366.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinformatics"},{"key":"660_CR12","volume-title":"In: Proceedings of the 9th International Symposium on Experimental Algorithms, SEA 2010","author":"C Whidden","year":"2010","unstructured":"Whidden C, Beiko R, Zeh N. Fast FPT algorithms for computing rooted agreement forests: Theory and experiments In: Festa P, editor. In: Proceedings of the 9th International Symposium on Experimental Algorithms, SEA 2010. Heidelberg, Germany: Springer: 2010. p. 141\u201353."},{"key":"660_CR13","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"},{"key":"660_CR14","volume-title":"Phylogenetic Networks: Concepts, Algorithm and Applications","author":"DH Huson","year":"2011","unstructured":"Huson DH, Rupp R, Scornavacca C. Phylogenetic Networks: Concepts, Algorithm and Applications. Shaftesbury Road, Cambridge: Cambridge University Press; 2011. doi: ISBN:9780521755962 ."},{"key":"660_CR15","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00285-005-0315-9","volume":"51","author":"M Baroni","year":"2005","unstructured":"Baroni M, Gruenewald S, Moulton V, Semple C. Bounding the number of hybridisation events for a consisten evolutionary history. Math Biol. 2005; 51:171\u201382.","journal-title":"Math Biol."},{"key":"660_CR16","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s00026-004-0229-z","volume":"8","author":"M Bordewich","year":"2005","unstructured":"Bordewich M, Semple C. On the computational complexity of the rooted subtree prune and regraft distance. Ann Combinator. 2005; 8:409\u201323.","journal-title":"Ann Combinator."},{"key":"660_CR17","volume-title":"Reticulation in evolution","author":"S Linz","year":"2008","unstructured":"Linz S. Reticulation in evolution. Germany: PhD thesis, Mathematisch-Naturwissenschaftliche Fakult\u00e4t der Heinrich-Heine-Universit\u00e4t D\u00fcsseldorf; 2008."},{"issue":"11","key":"660_CR18","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1089\/cmb.2012.0192","volume":"19","author":"C Scornavacca","year":"2010","unstructured":"Scornavacca C, Linz S, Albrecht B. A first step towards computing all hybridization networks for two rooted binary phylogenetic trees. J Comput Biol. 2010; 19(11):1227\u201342.","journal-title":"J Comput Biol."},{"key":"660_CR19","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1186\/1471-2105-9-532","volume":"9","author":"G Cardona","year":"2008","unstructured":"Cardona G, Rossello F, Valiente G. Extended newick: It is time for a standard representation of phylogenetic networks. BMC Bioinformatics. 2008; 9:532.","journal-title":"BMC Bioinformatics"},{"issue":"12","key":"660_CR20","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1093\/bioinformatics\/btq202","volume":"26","author":"S Kelk","year":"2010","unstructured":"van Iersel L, Kelk S, Rupp R, Huson DH. Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters. Bioinformatics. 2010; 26(12):124\u201331.","journal-title":"Bioinformatics"},{"key":"660_CR21","doi-asserted-by":"publisher","first-page":"2912","DOI":"10.1093\/bioinformatics\/btq548","volume":"26","author":"ZZ Chen","year":"2010","unstructured":"Chen ZZ, Wang L. Hybridnet: a tool for constructing hybridization networks. Bioinformatics. 2010; 26:2912\u20131913.","journal-title":"Bioinformatics"},{"key":"660_CR22","unstructured":"Kelk S, Linz S, Morrison DA. Fighting network space: it is time for an sql-type language to filter phylogenetic networks. arXiv:1310.6844. 2013."}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s12859-015-0660-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-015-0660-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-015-0660-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-015-0660-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T17:06:33Z","timestamp":1567011993000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-015-0660-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,30]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["660"],"URL":"https:\/\/doi.org\/10.1186\/s12859-015-0660-7","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,30]]},"assertion":[{"value":"15 April 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"236"}}