{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:35:30Z","timestamp":1743132930348,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031369100"},{"type":"electronic","value":"9783031369117"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-36911-7_11","type":"book-chapter","created":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T15:02:19Z","timestamp":1689174139000},"page":"162-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bounding the\u00a0Number of\u00a0Reticulations in\u00a0a\u00a0Tree-Child Network that\u00a0Displays a\u00a0Set of\u00a0Trees"],"prefix":"10.1007","author":[{"given":"Yufeng","family":"Wu","sequence":"first","affiliation":[]},{"given":"Louxin","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,13]]},"reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1109\/TCBB.2007.70270","volume":"6","author":"G Cardona","year":"2009","unstructured":"Cardona, G., Rossello, F., Valiente, G.: Comparison of tree-child phylogenetic networks. IEEE\/ACM Trans Comput. Biol. Bioinf. 6(4), 552\u2013569 (2009)","journal-title":"IEEE\/ACM Trans Comput. Biol. Bioinf."},{"key":"11_CR2","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. 3, 86\u201398 (2007)","journal-title":"Evol. Bioinf."},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.jcss.2020.06.001","volume":"114","author":"G Cardona","year":"2020","unstructured":"Cardona, G., Zhang, L.: Counting and enumerating tree-child networks and their subclasses. J. Comput. Syst. Sci. 114, 84\u2013104 (2020)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/TCBB.2011.137","volume":"9","author":"Z Chen","year":"2012","unstructured":"Chen, 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."},{"key":"11_CR5","series-title":"Computational Biology","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-030-10837-3_13","volume-title":"Bioinformatics and Phylogenetics","author":"RAL Elworth","year":"2019","unstructured":"Elworth, R.A.L., Ogilvie, H.A., Zhu, J., Nakhleh, L.: Advances in computational methods for phylogenetic networks in the presence of hybridization. In: Warnow, T. (ed.) Bioinformatics and Phylogenetics. CB, vol. 29, pp. 317\u2013360. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-10837-3_13"},{"key":"11_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2020.103278","volume":"93","author":"M Fuchs","year":"2021","unstructured":"Fuchs, M., Yu, G.-R., Zhang, L.: On the asymptotic growth of the number of tree-child networks. Eur. J. Comb. 93, 103278 (2021)","journal-title":"Eur. J. Comb."},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-319-16706-0_12","volume-title":"Research in Computational Molecular Biology","author":"P Gambette","year":"2015","unstructured":"Gambette, P., Gunawan, A.D.M., Labarre, A., Vialette, S., Zhang, L.: Locating a tree in a phylogenetic network in quadratic time. In: Przytycka, T.M. (ed.) RECOMB 2015. LNCS, vol. 9029, pp. 96\u2013107. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16706-0_12"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"373","DOI":"10.2307\/3298585","volume":"88","author":"Grass Phylogeny Working Group","year":"2001","unstructured":"Grass Phylogeny Working Group: Phylogeny and subfamilial classification of the grasses (poaceae). Ann. Mo. Bot. Gard. 88, 373\u2013457 (2001)","journal-title":"Ann. Mo. Bot. Gard."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.ic.2016.11.001","volume":"252","author":"AD Gunawan","year":"2017","unstructured":"Gunawan, A.D., DasGupta, B., Zhang, L.: A decomposition theorem and two algorithms for reticulation-visible networks. Inf. Comput. 252, 161\u2013175 (2017)","journal-title":"Inf. Comput."},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/j.dam.2020.03.005","volume":"283","author":"AD Gunawan","year":"2020","unstructured":"Gunawan, A.D., Rathin, J., Zhang, L.: Counting and enumerating galled networks. Disc. Appl. Math. 283, 644\u2013654 (2020)","journal-title":"Disc. Appl. Math."},{"key":"11_CR11","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9432.001.0001","volume-title":"ReCombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks","author":"D Gusfield","year":"2014","unstructured":"Gusfield, D.: ReCombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks. MIT press, Cambridge (2014)"},{"issue":"4","key":"11_CR12","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1287\/ijoc.1040.0099","volume":"16","author":"D Gusfield","year":"2004","unstructured":"Gusfield, D., Eddhu, S., Langley, C.: The fine structure of galls in phylogenetic networks. Informs J. Comput. 16(4), 459\u2013469 (2004)","journal-title":"Informs J. Comput."},{"key":"11_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511974076","volume-title":"Phylogenetic Networks: Concepts, Algorithms and Applications","author":"DH Huson","year":"2010","unstructured":"Huson, D.H., Rupp, R., Scornavacca, C.: Phylogenetic Networks: Concepts, Algorithms and Applications. Cambridge University Press, Cambridge (2010)"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1109\/TCBB.2015.2462336","volume":"13","author":"S Mirzaei","year":"2016","unstructured":"Mirzaei, S., Wu, Y.: Fast construction of near parsimonious hybridization networks for multiple phylogenetic trees. IEEE\/ACM Trans. Comput. Biol. Bioinf. 13, 565\u2013570 (2016)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-021-01166-w","volume":"11","author":"M Pons","year":"2021","unstructured":"Pons, M., Batle, J.: Combinatorial characterization of a certain class of words and a conjectured connection with general subclasses of phylogenetic tree-child networks. Sci. Rep. 11(1), 1\u201314 (2021)","journal-title":"Sci. Rep."},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Steel, M.: Phylogeny: discrete and random processes in evolution. SIAM (2016)","DOI":"10.1137\/1.9781611974485"},{"issue":"4","key":"11_CR17","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1007\/s00453-021-00914-8","volume":"84","author":"L van Iersel","year":"2022","unstructured":"van Iersel, L., Janssen, R., Jones, M., Murakami, Y., Zeh, N.: A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees. Algorithmica 84(4), 917\u2013960 (2022)","journal-title":"Algorithmica"},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1089\/106652701300099119","volume":"8","author":"L Wang","year":"2001","unstructured":"Wang, L., Zhang, K., Zhang, L.: Perfect phylogenetic networks with recombination. J. Comput. Biol. 8(1), 69\u201378 (2001)","journal-title":"J. Comput. Biol."},{"issue":"190\u2013196","key":"11_CR19","first-page":"2009","volume":"25","author":"Y Wu","year":"2009","unstructured":"Wu, Y.: A practical method for exact computation of subtree prune and regraft distance. Bioinformatics 25(190\u2013196), 2009 (2009)","journal-title":"Bioinformatics"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-13078-6_23","volume-title":"Bioinformatics Research and Applications","author":"Y Wu","year":"2010","unstructured":"Wu, Y., Wang, J.: Fast computation of the exact hybridization number of two phylogenetic trees. In: Borodovsky, M., Gogarten, J.P., Przytycka, T.M., Rajasekaran, S. (eds.) ISBRA 2010. LNCS, vol. 6053, pp. 203\u2013214. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13078-6_23"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Wu, Y.: Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees. Bioinformatics (supplement issue for ISMB 2010 proceedings) 26, 140\u2013148 (2010)","DOI":"10.1093\/bioinformatics\/btq198"},{"key":"11_CR22","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. 20, 792\u2013804 (2013)","journal-title":"J. Comput. Biol."},{"issue":"7","key":"11_CR23","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1089\/cmb.2015.0228","volume":"23","author":"L Zhang","year":"2016","unstructured":"Zhang, L.: On tree-based phylogenetic networks. J. Comput. Biol. 23(7), 553\u2013565 (2016)","journal-title":"J. Comput. Biol."},{"key":"11_CR24","series-title":"Computational Biology","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-030-10837-3_12","volume-title":"Bioinformatics and Phylogenetics","author":"L Zhang","year":"2019","unstructured":"Zhang, L.: Clusters, trees, and phylogenetic network classes. In: Warnow, T. (ed.) Bioinformatics and Phylogenetics. CB, vol. 29, pp. 277\u2013315. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-10837-3_12"},{"issue":"20","key":"11_CR25","first-page":"1","volume":"20","author":"L Zhang","year":"2019","unstructured":"Zhang, L.: Generating normal networks via leaf insertion and nearest neighbor interchange. BMC Bioinf. 20(20), 1\u20139 (2019)","journal-title":"BMC Bioinf."},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Zhang, L., Abhari, N., Colijn, C., Wu, Y.: A fast and scalable method for inferring phylogenetic networks from trees via aligning the ancestor sequences of taxa. In: To be Presented at RECOMB 2023 Conference (2022)","DOI":"10.1101\/gr.277669.123"}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36911-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T15:03:08Z","timestamp":1689174188000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36911-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031369100","9783031369117"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36911-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"13 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RECOMB-CG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"RECOMB International Workshop on Comparative Genomics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Istanbul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"T\u00fcrkiye","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rcg2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/recomb-cg.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}