{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T23:15:30Z","timestamp":1779405330587,"version":"3.53.1"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032268907","type":"print"},{"value":"9783032268914","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-3-032-26891-4_12","type":"book-chapter","created":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T22:20:52Z","timestamp":1779402052000},"page":"234-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Comparison of\u00a0LGT Networks and\u00a0Tree-Based Networks"],"prefix":"10.1007","author":[{"given":"Bertrand","family":"Marchand","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nadia","family":"Tahiri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Olivier","family":"Tremblay-Savard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manuel","family":"Lafond","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,22]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Doolittle, W.F., Bapteste, E.: Pattern pluralism and the tree of life hypothesis. Proc. Nat. Acad. Sci. 104(7), 2043\u20132049 (2007)","DOI":"10.1073\/pnas.0610699104"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1093\/molbev\/msh018","volume":"21","author":"D Bryant","year":"2004","unstructured":"Bryant, D., Moulton, V.: Neighbor-Net: an agglomerative method for the construction of phylogenetic networks. Mol. Biol. Evol. 21(2), 255\u2013265 (2004)","journal-title":"Mol. Biol. Evol."},{"issue":"4","key":"12_CR3","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1093\/sysbio\/syy015","volume":"67","author":"D Wen","year":"2018","unstructured":"Wen, D., Yun, Yu., Zhu, J., Nakhleh, L.: Inferring phylogenetic networks using PhyloNet. Syst. Biol. 67(4), 735\u2013740 (2018)","journal-title":"Syst. Biol."},{"issue":"12","key":"12_CR4","doi-asserted-by":"publisher","first-page":"3292","DOI":"10.1093\/molbev\/msx235","volume":"34","author":"C Sol\u00eds-Lemus","year":"2017","unstructured":"Sol\u00eds-Lemus, C., Bastide, P., An\u00e9, C.: Phylonetworks: a package for phylogenetic networks. Mol. Biol. Evol. 34(12), 3292\u20133298 (2017)","journal-title":"Mol. Biol. Evol."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Kong, S., Swofford, D.L., Kubatko, L.S.: Inference of phylogenetic networks from sequence data using composite likelihood. Syst. Biol. 74(1), 53\u201369 (2025)","DOI":"10.1093\/sysbio\/syae054"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1093\/sysbio\/syp103","volume":"59","author":"A Boc","year":"2010","unstructured":"Boc, A., Philippe, H., Makarenkov, V.: Inferring and validating horizontal gene transfer events using bipartition dissimilarity. Syst. Biol. 59(2), 195\u2013211 (2010)","journal-title":"Syst. Biol."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Robinson, D.F., Foulds, L.R.: Comparison of phylogenetic trees. Math. Biosci. 53(1-2), 131\u2013147 (1981)","DOI":"10.1016\/0025-5564(81)90043-2"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Lin, Y., Rajan, V., Moret, B.M.: A metric for phylogenetic trees based on matching. IEEE\/ACM Trans. Comput. Biol. Bioinf. 9(4), 1014\u20131022 (2011)","DOI":"10.1109\/TCBB.2011.157"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/TCBB.2008.70","volume":"6","author":"G Cardona","year":"2008","unstructured":"Cardona, G., Llabr\u00e9s, M., Rossell\u00f3, F., Valiente, G.: Metrics for phylogenetic networks I: generalizations of the Robinson-Foulds metric. IEEE\/ACM Trans. Comput. Biol. Bioinf. 6(1), 46\u201361 (2008)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Huson, D.H., Rupp, R., Berry, V., Gambette, P., Paul, C.: Computing galled networks from real data. Bioinformatics 25(12), i85\u2013i93 (2009)","DOI":"10.1093\/bioinformatics\/btp217"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Huson, D.H., Rupp, R., Scornavacca, C.: Phylogenetic Networks: Concepts, Algorithms and Applications. Cambridge University Press (2010)","DOI":"10.1017\/CBO9780511974076"},{"key":"12_CR12","doi-asserted-by":"crossref","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)","DOI":"10.1137\/S0097539704446529"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tcs.2006.06.022","volume":"363","author":"J Jansson","year":"2006","unstructured":"Jansson, J., Sung, W.-K.: Inferring a level-1 phylogenetic network from a dense set of rooted triplets. Theoret. Comput. Sci. 363(1), 60\u201368 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Huber, K.T., Moulton, V.: Encoding and constructing 1-nested phylogenetic networks with trinets. Algorithmica 66, 714\u2013738 (2013)","DOI":"10.1007\/s00453-012-9659-x"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Huson, D.H., Scornavacca, C.: A survey of combinatorial methods for phylogenetic networks. Genome Biol. Evol. 3, 23\u201335 (2011)","DOI":"10.1093\/gbe\/evq077"},{"issue":"3","key":"12_CR16","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1109\/TCBB.2008.127","volume":"6","author":"G Cardona","year":"2008","unstructured":"Cardona, G., Llabr\u00e9s, M., Rossell\u00f3, F., Valiente, G.: Metrics for phylogenetic networks ii: Nodal and triplets metrics. IEEE\/ACM Trans. Comput. Biol. Bioinf. 6(3), 454\u2013469 (2008)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Cardona, G., Pons, J.C., Ribas, G., Coronado, T.M.: Comparison of orchard networks using their extended $$\\mu $$-representation. IEEE\/ACM Trans. Comput. Biol. Bioinf. 21(3), 501\u2013507 (2024)","DOI":"10.1109\/TCBB.2024.3361390"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Bai, A., Erd\u0151s, P.L., Semple, C., Steel, M.: Defining phylogenetic networks using ancestral profiles. Math. Biosci. 332, 108537 (2021)","DOI":"10.1016\/j.mbs.2021.108537"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Maxfield, M., Xu, J., An\u00e9, C.: A dissimilarity measure for semidirected networks. IEEE Trans. Comput. Biol. Bioinf. (2025)","DOI":"10.1109\/TCBBIO.2025.3534780"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Allen, B.L., Steel, M.: Subtree transfer operations and their induced metrics on evolutionary trees. Ann. Combinatorics 5(1), 1\u201315 (2001)","DOI":"10.1007\/s00026-001-8006-8"},{"issue":"4","key":"12_CR21","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. Comb. 8(4), 409\u2013423 (2005)","journal-title":"Ann. Comb."},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jtbi.2017.03.032","volume":"423","author":"M Bordewich","year":"2017","unstructured":"Bordewich, M., Linz, S., Semple, C.: Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks. J. Theor. Biol. 423, 1\u201312 (2017)","journal-title":"J. Theor. Biol."},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Huber, K.T., Linz, S., Moulton, V., Wu, T.:0 Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations. J. Math. Biol. 72(3), 699\u2013725 (2016)","DOI":"10.1007\/s00285-015-0899-7"},{"issue":"8","key":"12_CR24","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1005611","volume":"13","author":"P Gambette","year":"2017","unstructured":"Gambette, P., Van Iersel, L., Jones, M., Lafond, M., Pardi, F., Scornavacca, C.: Rearrangement moves on rooted phylogenetic networks. PLoS Comput. Biol. 13(8), e1005611 (2017)","journal-title":"PLoS Comput. Biol."},{"key":"12_CR25","doi-asserted-by":"publisher","unstructured":"Marchand, B., Tahiri, N., Fard, S.G., et al.: Finding maximum common contractions between phylogenetic networks. Algorithms Mol. Biol. 20(1), 18 (2025). https:\/\/doi.org\/10.1186\/s13015-025-00283-9","DOI":"10.1186\/s13015-025-00283-9"},{"issue":"3","key":"12_CR26","doi-asserted-by":"publisher","first-page":"1654","DOI":"10.1109\/TCBB.2022.3162991","volume":"20","author":"K Landry","year":"2022","unstructured":"Landry, K., Teodocio, A., Lafond, M., Tremblay-Savard, O.: Defining phylogenetic network distances using cherry operations. IEEE\/ACM Trans. Comput. Biol. Bioinf. 20(3), 1654\u20131666 (2022)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"12_CR27","doi-asserted-by":"publisher","unstructured":"Landry, K., Tremblay-Savard, O.: Fast calculation of cherry distance on level-1 orchard networks: Optimization, heuristic and implementation. In: RECOMB International Workshop on Comparative Genomics, pp. 157\u2013177. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-031-94928-9_12","DOI":"10.1007\/978-3-031-94928-9_12"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Cardona, G., Pons, J.C., Rossell\u00f3, F.: A reconstruction problem for a class of phylogenetic networks with lateral gene transfers. Algorithms Mol. Biol. 10(1), 28 (2015)","DOI":"10.1186\/s13015-015-0059-z"},{"issue":"6","key":"12_CR29","first-page":"1669","volume":"75","author":"Gabriel Cardona and Joan Carles Pons","year":"2017","unstructured":"Gabriel Cardona and Joan Carles Pons: Reconstruction of LGT networks from tri-LGT-nets. J. Math. Biol. 75(6), 1669\u20131692 (2017)","journal-title":"J. Math. Biol."},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Jacox, E., Chauve, C., Sz\u00f6ll\u0151si, G.J., Ponty, Y., Scornavacca, C.: ECCETERA: comprehensive gene tree-species tree reconciliation using parsimony. Bioinformatics 32(13), 2056\u20132058 (2016)","DOI":"10.1093\/bioinformatics\/btw105"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Bansal, M.S., Kellis, M., Kordi, M., Kundu, S.: Ranger-DTL 2.0: rigorous reconstruction of gene-family evolution by duplication, transfer and loss. Bioinformatics 34(18), 3214\u20133216 (2018)","DOI":"10.1093\/bioinformatics\/bty314"},{"key":"12_CR32","unstructured":"Jones, M., Lafond, M., Scornavacca, C.: Consistency of orthology and paralogy constraints in the presence of gene transfers. Peer Community Math. Comput. Biol. (2022)"},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez, A., Lafond, M.: Predicting horizontal gene transfers with perfect transfer networks. Algorithms Mol. Biol. 19(1), 6 (2024)","DOI":"10.1186\/s13015-023-00242-2"},{"key":"12_CR34","doi-asserted-by":"publisher","unstructured":"S\u00e1nchez, A., Scholz, G.E., Stadler, P.F., Lafond, M.: A SANKOFF-ROUSSEAU-like algorithm for minimizing lateral gene transfers and losses on single origin characters. In: RECOMB International Workshop on Comparative Genomics, pp. 69\u201386. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-031-94928-9_5","DOI":"10.1007\/978-3-031-94928-9_5"},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"Francis, A.R., Steel, M.: Which phylogenetic networks are merely trees with additional arcs? Syst. Biol. 64(5), 768\u2013777 (2015)","DOI":"10.1093\/sysbio\/syv037"},{"key":"12_CR36","doi-asserted-by":"crossref","unstructured":"Kong, S., Pons, J.C., Kubatko, L., Wicke, K.: Classes of explicit phylogenetic networks and their biological and mathematical significance. J. Math. Biol. 84(6), 47 (2022)","DOI":"10.1007\/s00285-022-01746-y"},{"key":"12_CR37","doi-asserted-by":"publisher","unstructured":"Doyon, JP., Scornavacca, C., Gorbunov, K.Y., Sz\u00f6ll\u0151si, G.J., Ranwez, V., Berry, V.: An efficient algorithm for gene\/species trees parsimonious reconciliation with losses, duplications and transfers. In: RECOMB International Workshop on Comparative Genomics, pp. 93\u2013108. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-16181-0_9","DOI":"10.1007\/978-3-642-16181-0_9"},{"key":"12_CR38","doi-asserted-by":"crossref","unstructured":"Pons, J.C., Scornavacca, C., Cardona, G.: Generation of level-$$ k $$ k lgt networks. IEEE\/ACM Trans. Comput. Biol. Bioinf. 17(1), 158\u2013164 (2019)","DOI":"10.1109\/TCBB.2019.2895344"},{"issue":"1","key":"12_CR39","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF01908061","volume":"2","author":"WHE Day","year":"1985","unstructured":"Day, W.H.E.: Optimal algorithms for comparing trees with labeled leaves. J. Classif. 2(1), 7\u201328 (1985)","journal-title":"J. Classif."},{"issue":"1","key":"12_CR40","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/230514.571645","volume":"27","author":"M Sipser","year":"1996","unstructured":"Sipser, M.: Introduction to the theory of computation. ACM SIGACT News 27(1), 27\u201329 (1996)","journal-title":"ACM SIGACT News"},{"key":"12_CR41","doi-asserted-by":"crossref","unstructured":"Nakhleh, L., Ringe, D.A., Warnow, T.: Perfect phylogenetic networks: a new methodology for reconstructing the evolutionary history of natural languages. Language 81(2), 382\u2013420 (2005)","DOI":"10.1353\/lan.2005.0078"},{"key":"12_CR42","doi-asserted-by":"publisher","unstructured":"S\u00e1nchez, A., Lafond, M.: Galled perfect transfer networks. In: RECOMB International Workshop on Comparative Genomics, pp. 24\u201343. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-58072-7_2","DOI":"10.1007\/978-3-031-58072-7_2"},{"key":"12_CR43","doi-asserted-by":"crossref","unstructured":"Wu, L., Lambert, J.D.: Clade-specific genes and the evolutionary origin of novelty; new tools in the toolkit. In: Seminars in Cell & Developmental Biology, vol. 145, pp. 52\u201359 (2023)","DOI":"10.1016\/j.semcdb.2022.05.025"},{"key":"12_CR44","doi-asserted-by":"crossref","unstructured":"Wang, Y.W., Hess, J., Slot, J.C., Pringle, A.: De novo gene birth, horizontal gene transfer, and gene duplication as sources of new gene families associated with the origin of symbiosis in amanita. Genome Biol. Evol. 12(11), 2168\u20132182 (2020)","DOI":"10.1093\/gbe\/evaa193"},{"key":"12_CR45","doi-asserted-by":"crossref","unstructured":"Kanehisa, M.: The KEGG database. In: In silico\u2019simulation of biological processes: Novartis Foundation Symposium 247, vol. 247, pp. 91\u2013103. Wiley Online Library (2002)","DOI":"10.1002\/0470857897.ch8"},{"key":"12_CR46","doi-asserted-by":"crossref","unstructured":"Schoch, C.L., et\u00a0al.: NCBI taxonomy: a comprehensive update on curation, resources and tools. Database, 2020:baaa062 (2020)","DOI":"10.1093\/database\/baaa062"},{"key":"12_CR47","doi-asserted-by":"crossref","unstructured":"David Schaller, Marc Hellmuth, and Peter\u00a0F Stadler. Asymmetree: A flexible python package for the simulation of complex gene family histories. Software, 1(3):276\u2013298, 2022","DOI":"10.3390\/software1030013"},{"issue":"12","key":"12_CR48","doi-asserted-by":"publisher","first-page":"256","DOI":"10.3390\/a12120256","volume":"12","author":"L Bulteau","year":"2019","unstructured":"Bulteau, L., Weller, M.: Parameterized algorithms in bioinformatics: an overview. Algorithms 12(12), 256 (2019)","journal-title":"Algorithms"}],"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-032-26891-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T22:20:59Z","timestamp":1779402059000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-26891-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032268907","9783032268914"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-26891-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"22 May 2026","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":"Thessaloniki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rcg2026","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"}}]}}