{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:56:12Z","timestamp":1757620572041,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":33,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819506941"},{"type":"electronic","value":"9789819506958"}],"license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-0695-8_32","type":"book-chapter","created":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T12:54:08Z","timestamp":1753966448000},"page":"398-410","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Algorithms for\u00a0the\u00a0Tree Containment Problem on\u00a0Multifurcating Phylogenetic Network"],"prefix":"10.1007","author":[{"given":"Feng","family":"Shi","sequence":"first","affiliation":[]},{"given":"Zhanglian","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Zeng","sequence":"additional","affiliation":[]},{"given":"Jingyi","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,1]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ympev.2024.108137","volume":"199","author":"G Bernardini","year":"2024","unstructured":"Bernardini, G., van Iersel, L., Julien, E., Stougie, L.: Inferring phylogenetic networks from multifurcating trees via cherry picking and machine learning. Mol. Phylogenet. Evol. 199, 108137 (2024)","journal-title":"Mol. Phylogenet. Evol."},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.aam.2016.04.004","volume":"78","author":"M Bordewich","year":"2016","unstructured":"Bordewich, M., Semple, C.: Reticulation-visible networks. Adv. Appl. Math. 78, 114\u2013141 (2016)","journal-title":"Adv. Appl. Math."},{"unstructured":"Boussau, B., Scornavacca, C.: Reconciling gene trees with species trees. Phylogenetics in the genomic era pp.\u00a03\u20132 (2020)","key":"32_CR3"},{"issue":"46","key":"32_CR4","doi-asserted-by":"publisher","first-page":"18566","DOI":"10.1073\/pnas.1313480110","volume":"110","author":"JM Chan","year":"2013","unstructured":"Chan, J.M., Carlsson, G., Rabadan, R.: Topology of viral evolution. Proc. Natl. Acad. Sci. 110(46), 18566\u201318571 (2013)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1016\/j.tcs.2014.10.031","volume":"562","author":"J Chen","year":"2015","unstructured":"Chen, J., Fan, J.H., Sze, S.H.: Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees. Theoret. Comput. Sci. 562, 496\u2013512 (2015)","journal-title":"Theoret. Comput. Sci."},{"unstructured":"Dushatskiy, A., Julien, E., Stougie, L., van Iersel, L.: Solving the tree containment problem using graph neural networks. Trans. Mach. Learn. Res. (2024). https:\/\/openreview.net\/forum?id=nK5MazeIpn","key":"32_CR6"},{"doi-asserted-by":"crossref","unstructured":"Fakcharoenphol, J., Kumpijit, T., Putwattana, A.: A faster algorithm for the tree containment problem for binary nearly stable phylogenetic networks. In: the 12th International Joint Conference on Computer Science and Software Engineering, pp. 337\u2013342. IEEE (2015)","key":"32_CR7","DOI":"10.1109\/JCSSE.2015.7219820"},{"issue":"2","key":"32_CR8","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.ympev.2006.07.004","volume":"42","author":"J Fehrer","year":"2007","unstructured":"Fehrer, J., Gemeinholzer, B., Chrtek, J., Jr., Br\u00e4utigam, S.: Incongruent plastid and nuclear DNA phylogenies reveal ancient intergeneric hybridization in Pilosella hawkweeds (hieracium, cichorieae, asteraceae). Mol. Phylogenet. Evol. 42(2), 347\u2013361 (2007)","journal-title":"Mol. Phylogenet. Evol."},{"doi-asserted-by":"publisher","unstructured":"Gambette, P., Gunawan, A., 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":"32_CR9","DOI":"10.1007\/978-3-319-16706-0_12"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.dam.2017.07.015","volume":"246","author":"P Gambette","year":"2018","unstructured":"Gambette, P., Gunawan, A.D., Labarre, A., Vialette, S., Zhang, L.: Solving the tree containment problem in linear time for nearly stable phylogenetic networks. Discret. Appl. Math. 246, 62\u201379 (2018)","journal-title":"Discret. Appl. Math."},{"doi-asserted-by":"publisher","unstructured":"Gunawan, A.: Solving the tree containment problem for reticulation-visible networks in linear time. In: Jansson, J., Mart\u00edn-Vide, C., Vega-Rodr\u00edguez, M.A. (eds.) AlCoB 2018. LNCS, vol. 10849, pp. 24\u201336. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91938-6_3","key":"32_CR11","DOI":"10.1007\/978-3-319-91938-6_3"},{"key":"32_CR12","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."},{"issue":"17","key":"32_CR13","doi-asserted-by":"publisher","first-page":"i503","DOI":"10.1093\/bioinformatics\/btw467","volume":"32","author":"AD Gunawan","year":"2016","unstructured":"Gunawan, A.D., Lu, B., Zhang, L.: A program for verification of phylogenetic network models. Bioinformatics 32(17), i503\u2013i510 (2016)","journal-title":"Bioinformatics"},{"issue":"2","key":"32_CR14","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0025-5564(90)90123-G","volume":"98","author":"J Hein","year":"1990","unstructured":"Hein, J.: Reconstructing evolution of sequences subject to recombination using parsimony. Math. Biosci. 98(2), 185\u2013200 (1990)","journal-title":"Math. Biosci."},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/BF00182187","volume":"36","author":"J Hein","year":"1993","unstructured":"Hein, J.: A heuristic method to reconstruct the history of sequences subject to recombination. J. Mol. Evol. 36, 396\u2013405 (1993)","journal-title":"J. Mol. Evol."},{"issue":"2","key":"32_CR16","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1109\/TCBB.2016.2537326","volume":"15","author":"DH Huson","year":"2016","unstructured":"Huson, D.H., Linz, S.: Autumn algorithm\u2014computation of hybridization networks for realistic phylogenetic trees. IEEE\/ACM Trans. Comput. Biol. Bioinf. 15(2), 398\u2013410 (2016)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"doi-asserted-by":"crossref","unstructured":"Huson, D.H., Rupp, R., Scornavacca, C.: Phylogenetic Networks: Concepts, Algorithms and Applications. Cambridge University Press, Cambridge (2010)","key":"32_CR17","DOI":"10.1017\/CBO9780511974076"},{"issue":"21","key":"32_CR18","doi-asserted-by":"publisher","first-page":"2604","DOI":"10.1093\/bioinformatics\/btl452","volume":"22","author":"G Jin","year":"2006","unstructured":"Jin, G., Nakhleh, L., Snir, S., Tuller, T.: Maximum likelihood of phylogenetic networks. Bioinformatics 22(21), 2604\u20132611 (2006)","journal-title":"Bioinformatics"},{"issue":"1\u20133","key":"32_CR19","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.tcs.2008.04.019","volume":"401","author":"IA Kanj","year":"2008","unstructured":"Kanj, I.A., Nakhleh, L., Than, C., Xia, G.: Seeing the trees and their branches in the network is hard. Theoret. Comput. Sci. 401(1\u20133), 153\u2013164 (2008)","journal-title":"Theoret. Comput. Sci."},{"unstructured":"Nakhleh, L.: Recombinatorics: The algorithmics of ancestral recombination graphs and explicit phylogenetic networks (2015)","key":"32_CR20"},{"issue":"4","key":"32_CR21","doi-asserted-by":"publisher","first-page":"911","DOI":"10.2307\/25065478","volume":"54","author":"O Paun","year":"2005","unstructured":"Paun, O., Lehnebach, C., Johansson, J.T., Lockhart, P., H\u00f6randl, E.: Phylogenetic relationships and biogeography of ranunculus and allied genera (ranunculaceae) in the Mediterranean region and in the European alpine system. Taxon 54(4), 911\u2013932 (2005)","journal-title":"Taxon"},{"unstructured":"Ruths, L.N.D., Innan, H.: Gene trees, species trees, and species networks","key":"32_CR22"},{"key":"32_CR23","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.jcss.2018.03.002","volume":"97","author":"F Shi","year":"2018","unstructured":"Shi, F., Chen, J., Feng, Q., Wang, J.: A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees. J. Comput. Syst. Sci. 97, 28\u201344 (2018)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"32_CR24","doi-asserted-by":"publisher","first-page":"3539","DOI":"10.1109\/TCBB.2021.3111660","volume":"19","author":"F Shi","year":"2021","unstructured":"Shi, F., Li, H., Rong, G., Zhang, Z., Wang, J.: Improved fixed-parameter algorithm for the tree containment problem on unrooted phylogenetic network. IEEE\/ACM Trans. Comput. Biol. Bioinf. 19(6), 3539\u20133552 (2021)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"doi-asserted-by":"publisher","unstructured":"Shi, F., Wang, J., Yang, Y., Feng, Q., Li, W., Chen, J.: A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees. Science China Inf. Sci. 59(1), 1\u201314 (2016). https:\/\/doi.org\/10.1007\/s11432-015-5355-1","key":"32_CR25","DOI":"10.1007\/s11432-015-5355-1"},{"issue":"3","key":"32_CR26","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1109\/TCBB.2008.26","volume":"5","author":"S Sridhar","year":"2008","unstructured":"Sridhar, S., Lam, F., Blelloch, G.E., Ravi, R., Schwartz, R.: Mixed integer linear programming for maximum-parsimony phylogeny inference. IEEE\/ACM Trans. Comput. Biol. Bioinf. 5(3), 323\u2013331 (2008)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"1","key":"32_CR27","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pgen.1001284","volume":"7","author":"TJ Treangen","year":"2011","unstructured":"Treangen, T.J., Rocha, E.P.: Horizontal transfer, not duplication, drives the expansion of protein families in prokaryotes. PLoS Genet. 7(1), e1001284 (2011)","journal-title":"PLoS Genet."},{"doi-asserted-by":"crossref","unstructured":"Van\u00a0Iersel, L., Jones, M., Weller, M.: Embedding phylogenetic trees in networks of low treewidth. Discrete Math. Theoret. Comput. Sci. 25, 10 (2023)","key":"32_CR28","DOI":"10.46298\/dmtcs.10116"},{"issue":"6","key":"32_CR29","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."},{"key":"32_CR30","doi-asserted-by":"publisher","first-page":"2993","DOI":"10.1007\/s00453-017-0366-5","volume":"80","author":"L Van Iersel","year":"2018","unstructured":"Van Iersel, L., Kelk, S., Stamoulis, G., Stougie, L., Boes, O.: On unrooted and root-uncertain variants of several well-known phylogenetic network problems. Algorithmica 80, 2993\u20133022 (2018)","journal-title":"Algorithmica"},{"issue":"23","key":"32_CR31","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1016\/j.ipl.2010.07.027","volume":"110","author":"L Van Iersel","year":"2010","unstructured":"Van Iersel, L., Semple, C., Steel, M.: Locating a tree in a phylogenetic network. Inf. Process. Lett. 110(23), 1037\u20131043 (2010)","journal-title":"Inf. Process. Lett."},{"key":"32_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-030-00834-5_18","volume-title":"Comparative Genomics","author":"M Weller","year":"2018","unstructured":"Weller, M.: Linear-time tree containment in phylogenetic networks. In: Blanchette, M., Ouangraoua, A. (eds.) RECOMB-CG 2018. LNCS, vol. 11183, pp. 309\u2013323. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00834-5_18"},{"issue":"3","key":"32_CR33","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1007\/s00453-015-9983-z","volume":"74","author":"C Whidden","year":"2016","unstructured":"Whidden, C., Beiko, R.G., Zeh, N.: Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees. Algorithmica 74(3), 1019\u20131054 (2016)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-0695-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T09:15:47Z","timestamp":1757322947000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-0695-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,1]]},"ISBN":["9789819506941","9789819506958"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-0695-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,1]]},"assertion":[{"value":"1 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISBRA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Bioinformatics Research and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Helsinki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isbra2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.helsinki.fi\/en\/conferences\/isbra2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}