{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,12]],"date-time":"2026-04-12T20:41:35Z","timestamp":1776026495626,"version":"3.50.1"},"reference-count":76,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T00:00:00Z","timestamp":1755561600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T00:00:00Z","timestamp":1755561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100009874","name":"Universit\u00e9 de Sherbrooke","doi-asserted-by":"publisher","award":["Bourse d'excellence en recherche"],"award-info":[{"award-number":["Bourse d'excellence en recherche"]}],"id":[{"id":"10.13039\/100009874","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003141","name":"Consejo Nacional de Humanidades, Ciencias y Tecnolog\u00edas","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003141","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003151","name":"Fonds de recherche du Qu\u00e9bec \u2013 Nature et technologies","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003151","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:sec>\n            <jats:title>Background<\/jats:title>\n            <jats:p>In this study, we investigate the problem of comparing gene trees reconciled with the same species tree using a novel semi-metric, called the Path-Label Reconciliation (PLR) dissimilarity measure. This approach not only quantifies differences in the topology of reconciled gene trees, but also considers discrepancies in predicted ancestral gene-species maps and speciation\/duplication events, offering a refinement of existing metrics such as Robinson-Foulds (RF) and their labeled extensions LRF and ELRF. A tunable parameter <jats:inline-formula>\n                <jats:alternatives>\n                  <jats:tex-math>$$\\alpha$$<\/jats:tex-math>\n                  <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                    <mml:mi>\u03b1<\/mml:mi>\n                  <\/mml:math>\n                <\/jats:alternatives>\n              <\/jats:inline-formula> also allows users to adjust the balance between its species map and event labeling components.<\/jats:p>\n          <\/jats:sec>\n          <jats:sec>\n            <jats:title>Our contributions<\/jats:title>\n            <jats:p>We show that PLR can be computed in linear time and that it is a semi-metric. We also discuss the diameters of reconciled gene tree measures, which are important in practice for normalization, and provide initial bounds on PLR, LRF, and ELRF. To validate PLR, we simulate reconciliations and perform comparisons with LRF and ELRF. The results show that PLR\u00a0provides a more evenly distributed range of distances, making it less susceptible to overestimating differences in the presence of small topological changes, while at the same time being computationally efficient. We also apply our measure to evaluate the set of possible rootings of gene trees against a gold standard, and demonstrate that our measure is better at distinguishing one best gene tree among multiple candidates. Furthermore, our findings suggest that the theoretical diameter is rarely reached in practice. The PLR\u00a0measure advances phylogenetic reconciliation by combining theoretical rigor with practical applicability. Future research will refine its mathematical properties, explore its performance on different types of trees, and integrate it with existing bioinformatics tools for large-scale evolutionary analyses. The implementation of the PLR distance is available in the open-source PyPI package : <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/pypi.org\/project\/parle\/\" ext-link-type=\"uri\">https:\/\/pypi.org\/project\/parle\/<\/jats:ext-link>.<\/jats:p>\n          <\/jats:sec>","DOI":"10.1186\/s13015-025-00284-8","type":"journal-article","created":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T11:14:52Z","timestamp":1755602092000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The path-label reconciliation (PLR) dissimilarity measure for gene trees"],"prefix":"10.1186","volume":"20","author":[{"given":"Alitzel L\u00f3pez","family":"S\u00e1nchez","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 Antonio","family":"Ram\u00edrez-Rafael","sequence":"additional","affiliation":[]},{"given":"Alejandro","family":"Flores-Lamas","sequence":"additional","affiliation":[]},{"given":"Maribel","family":"Hern\u00e1ndez-Rosales","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Lafond","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,19]]},"reference":[{"issue":"2","key":"284_CR1","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1093\/sysbio\/28.2.132","volume":"28","author":"M Goodman","year":"1979","unstructured":"Goodman M, Czelusniak J, Moore GW, Romero-Herrera AE, Matsuda G. Fitting the gene lineage into its species lineage, a parsimony strategy illustrated by cladograms constructed from globin sequences. Syst Biol.. 1979;28(2):132\u201363.","journal-title":"Syst Biol."},{"issue":"2","key":"284_CR2","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1089\/cmb.1997.4.177","volume":"4","author":"L Zhang","year":"1997","unstructured":"Zhang L. On a Mirkin-Muchnik-Smith conjecture for comparing molecular phylogenies. J Comput Biol. 1997;4(2):177\u201387.","journal-title":"J Comput Biol."},{"issue":"1\u20133","key":"284_CR3","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.tcs.2006.05.019","volume":"359","author":"P G\u00f3recki","year":"2006","unstructured":"G\u00f3recki P, Tiuryn J. DLS-trees: a model of evolutionary scenarios. Theor Comput Sci. 2006;359(1\u20133):378\u201399.","journal-title":"Theor Comput Sci."},{"issue":"1\u20132","key":"284_CR4","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.tcs.2005.05.016","volume":"347","author":"P Bonizzoni","year":"2005","unstructured":"Bonizzoni P, Della Vedova G, Dondi R. Reconciling a gene tree to a species tree under the duplication cost model. Theor Comput Sci. 2005;347(1\u20132):36\u201353.","journal-title":"Theor Comput Sci."},{"key":"284_CR5","doi-asserted-by":"crossref","unstructured":"Durand D, Halld\u00f3rsson BV, Vernot B. A hybrid micro-macroevolutionary approach to gene tree reconstruction. In: Research in computational molecular biology: 9th Annual International Conference, RECOMB 2005, Cambridge, MA, USA, May 14\u201318, 2005. Proceedings 9. Springer; 2005. p. 250\u2013264.","DOI":"10.1007\/11415770_19"},{"issue":"8","key":"284_CR6","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1089\/cmb.2008.0092","volume":"15","author":"B Vernot","year":"2008","unstructured":"Vernot B, Stolzer M, Goldman A, Durand D. Reconciliation with non-binary species trees. J Comput Biol. 2008;15(8):981\u20131006.","journal-title":"J Comput Biol."},{"key":"284_CR7","doi-asserted-by":"crossref","unstructured":"Lafond M, Swenson KM, El-Mabrouk N. An optimal reconciliation algorithm for gene trees with polytomies. In: Algorithms in bioinformatics: 12th International Workshop, WABI 2012, Ljubljana, Slovenia, September 10\u201312, 2012. Proceedings 12. Springer; 2012. p. 106\u2013122.","DOI":"10.1007\/978-3-642-33122-0_9"},{"key":"284_CR8","doi-asserted-by":"crossref","unstructured":"Hernandez-Rosales M, Hellmuth M, Wieseke N, Huber KT, Moulton V, Stadler PF. From event-labeled gene trees to species trees. In: BMC bioinformatics. vol.\u00a013. Springer; 2012. p. 1\u201311.","DOI":"10.1186\/1471-2105-13-S19-S6"},{"issue":"5","key":"284_CR9","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1007\/s00285-020-01469-y","volume":"80","author":"M Gei\u00df","year":"2020","unstructured":"Gei\u00df M, Laffitte MEG, S\u00e1nchez AL, Valdivia DI, Hellmuth M, Rosales MH, et al. Best match graphs and reconciliation of gene trees with species trees. J Math Biol. 2020;80(5):1459\u201395.","journal-title":"J Math Biol."},{"key":"284_CR10","doi-asserted-by":"crossref","unstructured":"G\u00f3recki P. Reconciliation problems for duplication, loss and horizontal gene transfer. In: Proceedings of the eighth annual international conference on Research in computational molecular biology; 2004. p. 316\u2013325.","DOI":"10.1145\/974614.974656"},{"key":"284_CR11","doi-asserted-by":"crossref","unstructured":"Doyon JP, Scornavacca C, Gorbunov KY, Sz\u00f6ll\u0151si GJ, Ranwez V, Berry V. An efficient algorithm for gene\/species trees parsimonious reconciliation with losses, duplications and transfers. In: Comparative Genomics: International Workshop, RECOMB-CG 2010, Ottawa, Canada, October 9\u201311, 2010. Proceedings 8. Springer; 2010. p. 93\u2013108.","DOI":"10.1007\/978-3-642-16181-0_9"},{"issue":"12","key":"284_CR12","doi-asserted-by":"publisher","first-page":"i283","DOI":"10.1093\/bioinformatics\/bts225","volume":"28","author":"MS Bansal","year":"2012","unstructured":"Bansal MS, Alm EJ, Kellis M. Efficient algorithms for the reconciliation problem with gene duplication, horizontal transfer and loss. Bioinformatics. 2012;28(12):i283\u201391.","journal-title":"Bioinformatics."},{"key":"284_CR13","doi-asserted-by":"crossref","unstructured":"Kordi M, Bansal MS. Exact algorithms for duplication-transfer-loss reconciliation with non-binary gene trees. In: Proceedings of the 7th ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics; 2016. p. 297\u2013306.","DOI":"10.1145\/2975167.2975198"},{"issue":"7","key":"284_CR14","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1093\/bioinformatics\/btw778","volume":"33","author":"E Jacox","year":"2017","unstructured":"Jacox E, Weller M, Tannier E, Scornavacca C. Resolution and reconciliation of non-binary gene trees with transfers, duplications and losses. Bioinformatics. 2017;33(7):980\u20137.","journal-title":"Bioinformatics."},{"key":"284_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.jtbi.2017.01.024","volume":"418","author":"C Scornavacca","year":"2017","unstructured":"Scornavacca C, Mayol JCP, Cardona G. Fast algorithm for the reconciliation of gene trees and LGT networks. J Theor Biol. 2017;418:129\u201337.","journal-title":"J Theor Biol."},{"key":"284_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13015-018-0121-8","volume":"13","author":"N N\u00f8jgaard","year":"2018","unstructured":"N\u00f8jgaard N, Gei\u00df M, Merkle D, Stadler PF, Wieseke N, Hellmuth M. Time-consistent reconciliation maps and forbidden time travel. Algorithms Mol Biol.. 2018;13:1\u201317.","journal-title":"Algorithms Mol Biol."},{"key":"284_CR17","doi-asserted-by":"crossref","unstructured":"Kordi M, Kundu S, Bansal MS. On inferring additive and replacing horizontal gene transfers through phylogenetic reconciliation. In: Proceedings of the 10th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics; 2019. p. 514\u2013523.","DOI":"10.1145\/3307339.3342168"},{"issue":"8","key":"284_CR18","doi-asserted-by":"publisher","first-page":"231","DOI":"10.3390\/a14080231","volume":"14","author":"S Weiner","year":"2021","unstructured":"Weiner S, Bansal MS. Improved duplication-transfer-loss reconciliation with extinct and unsampled lineages. Algorithms. 2021;14(8):231.","journal-title":"Algorithms."},{"issue":"1","key":"284_CR19","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s00285-021-01631-0","volume":"83","author":"D Schaller","year":"2021","unstructured":"Schaller D, Lafond M, Stadler PF, Wieseke N, Hellmuth M. Indirect identification of horizontal gene transfer. J Math Biol. 2021;83(1):10.","journal-title":"J Math Biol"},{"issue":"6","key":"284_CR20","doi-asserted-by":"publisher","first-page":"1685","DOI":"10.1109\/TCBB.2011.83","volume":"8","author":"L Zhang","year":"2011","unstructured":"Zhang L. From gene trees to species trees II: species tree inference by minimizing deep coalescence events. IEEE\/ACM Trans Comput Biol Bioinform. 2011;8(6):1685\u201391.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"18","key":"284_CR21","doi-asserted-by":"publisher","first-page":"i409","DOI":"10.1093\/bioinformatics\/bts386","volume":"28","author":"M Stolzer","year":"2012","unstructured":"Stolzer M, Lai H, Xu M, Sathaye D, Vernot B, Durand D. Inferring duplications, losses, transfers and incomplete lineage sorting with nonbinary species trees. Bioinformatics. 2012;28(18):i409\u201315.","journal-title":"Bioinformatics."},{"issue":"4","key":"284_CR22","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1101\/gr.123901.111","volume":"22","author":"MD Rasmussen","year":"2012","unstructured":"Rasmussen MD, Kellis M. Unified modeling of gene duplication, loss, and coalescence using a locus tree. Genome Res. 2012;22(4):755\u201365.","journal-title":"Genome Res."},{"issue":"3","key":"284_CR23","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1101\/gr.161968.113","volume":"24","author":"YC Wu","year":"2014","unstructured":"Wu YC, Rasmussen MD, Bansal MS, Kellis M. Most parsimonious reconciliation in the presence of gene duplication, loss, and deep coalescence using labeled coalescent trees. Genome Res. 2014;24(3):475\u201386.","journal-title":"Genome Res."},{"key":"284_CR24","doi-asserted-by":"crossref","unstructured":"Chan Yb, Ranwez V, Scornavacca C. Inferring incomplete lineage sorting, duplications, transfers and losses with reconciliations. J Theor Biol. 2017;432:1\u201313.","DOI":"10.1016\/j.jtbi.2017.08.008"},{"issue":"4","key":"284_CR25","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1093\/sysbio\/syaa084","volume":"70","author":"Q Li","year":"2021","unstructured":"Li Q, Scornavacca C, Galtier N, Chan YB. The multilocus multispecies coalescent: a flexible new model of gene family evolution. Syst Biol. 2021;70(4):822\u201337.","journal-title":"Syst Biol."},{"key":"284_CR26","doi-asserted-by":"crossref","unstructured":"Delabre M, El-Mabrouk N, Huber KT, Lafond M, Moulton V, Noutahi E, et\u00a0al. Reconstructing the history of syntenies through super-reconciliation. In: Comparative Genomics: 16th International Conference, RECOMB-CG 2018, Magog-Orford, QC, Canada, October 9-12, 2018, Proceedings 16. Springer; 2018. p. 179\u2013195.","DOI":"10.1007\/978-3-030-00834-5_10"},{"key":"284_CR27","doi-asserted-by":"crossref","unstructured":"Li L, Bansal MS. Simultaneous multi-domain-multi-gene reconciliation under the domain-gene-species reconciliation model. In: Bioinformatics Research and Applications: 15th International Symposium, ISBRA 2019, Barcelona, Spain, June 3\u20136, 2019, Proceedings 15. Springer; 2019. p. 73\u201386.","DOI":"10.1007\/978-3-030-20242-2_7"},{"issue":"6","key":"284_CR28","doi-asserted-by":"publisher","first-page":"1981","DOI":"10.1007\/s00285-019-01331-w","volume":"78","author":"D Hasi\u0107","year":"2019","unstructured":"Hasi\u0107 D, Tannier E. Gene tree species tree reconciliation with gene conversion. J Math Biol. 2019;78(6):1981\u20132014.","journal-title":"J Math Biol."},{"key":"284_CR29","unstructured":"Boussau B, Scornavacca C. Reconciling gene trees with species trees. Phylogenetics in the genomic era. 2020;p. 3\u20132."},{"key":"284_CR30","doi-asserted-by":"crossref","unstructured":"Anselmetti Y, El-Mabrouk N, Lafond M, Ouangraoua A. Gene tree and species tree reconciliation with endosymbiotic gene transfer. Bioinformatics. 2021;37(Supplement_1):i120\u2013i132.","DOI":"10.1093\/bioinformatics\/btab328"},{"issue":"16","key":"284_CR31","doi-asserted-by":"publisher","first-page":"2481","DOI":"10.1093\/bioinformatics\/btaa978","volume":"37","author":"S Santichaivekin","year":"2021","unstructured":"Santichaivekin S, Yang Q, Liu J, Mawhorter R, Jiang J, Wesley T, et al. eMPRess: a systematic cophylogeny reconciliation tool. Bioinformatics. 2021;37(16):2481\u20132.","journal-title":"Bioinformatics."},{"key":"284_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-021-04290-6","volume":"22","author":"J Liu","year":"2021","unstructured":"Liu J, Mawhorter R, Liu N, Santichaivekin S, Bush E, Libeskind-Hadas R. Maximum parsimony reconciliation in the DTLOR model. BMC Bioinform. 2021;22:1\u201322.","journal-title":"BMC Bioinform."},{"key":"284_CR33","doi-asserted-by":"crossref","unstructured":"Page RD, Cotton J. Vertebrate phylogenomics: reconciled trees and gene duplications. In: Biocomputing 2002. World Scientific; 2001. p. 536\u2013547.","DOI":"10.1142\/9789812799623_0050"},{"key":"284_CR34","doi-asserted-by":"crossref","unstructured":"Burleigh JG, Bansal MS, Wehe A, Eulenstein O. Locating multiple gene duplications through reconciled trees. In: Research in Computational Molecular Biology: 12th Annual International Conference, RECOMB 2008, Singapore, March 30\u2013April 2, 2008. Proceedings 12. Springer; 2008. p. 273\u2013284.","DOI":"10.1007\/978-3-540-78839-3_24"},{"issue":"13","key":"284_CR35","doi-asserted-by":"publisher","first-page":"i132","DOI":"10.1093\/bioinformatics\/btn150","volume":"24","author":"MS Bansal","year":"2008","unstructured":"Bansal MS, Eulenstein O. The multiple gene duplication problem revisited. Bioinformatics. 2008;24(13):i132\u20138.","journal-title":"Bioinformatics."},{"issue":"5","key":"284_CR36","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1109\/TCBB.2017.2706679","volume":"15","author":"J Paszek","year":"2017","unstructured":"Paszek J, G\u00f3recki P. Efficient algorithms for genomic duplication models. IEEE\/ACM Trans Comput Biol Bioinform. 2017;15(5):1515\u201324.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform."},{"key":"284_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13015-019-0139-6","volume":"14","author":"R Dondi","year":"2019","unstructured":"Dondi R, Lafond M, Scornavacca C. Reconciling multiple genes trees via segmental duplications and losses. Algorithms Mol Biol. 2019;14:1\u201319.","journal-title":"Algorithms Mol Biol"},{"issue":"1","key":"284_CR38","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1093\/bioinformatics\/btg1000","volume":"19","author":"L Arvestad","year":"2003","unstructured":"Arvestad L, Berglund AC, Lagergren J, Sennblad B. Bayesian gene\/species tree reconciliation and orthology analysis using MCMC. Bioinformatics-Oxford. 2003;19(1):7\u201315.","journal-title":"Bioinformatics-Oxford."},{"issue":"14","key":"284_CR39","doi-asserted-by":"publisher","first-page":"5714","DOI":"10.1073\/pnas.0806251106","volume":"106","author":"\u00d6 \u00c5kerborg","year":"2009","unstructured":"\u00c5kerborg \u00d6, Sennblad B, Arvestad L, Lagergren J. Simultaneous Bayesian gene tree reconstruction and reconciliation analysis. Proc Natl Acad Sci. 2009;106(14):5714\u20139.","journal-title":"Proc Natl Acad Sci."},{"issue":"22","key":"284_CR40","doi-asserted-by":"publisher","first-page":"2910","DOI":"10.1093\/bioinformatics\/btq539","volume":"26","author":"BR Larget","year":"2010","unstructured":"Larget BR, Kotha SK, Dewey CN, An\u00e9 C. BUCKy: gene tree\/species tree reconciliation with Bayesian concordance analysis. Bioinformatics. 2010;26(22):2910\u20131.","journal-title":"Bioinformatics."},{"key":"284_CR41","doi-asserted-by":"crossref","unstructured":"Bansal MS, Kellis M, Kordi M, Kundu S. RANGER-DTL 2.0: rigorous reconstruction of gene-family evolution by duplication, transfer and loss. Bioinformatics. 2018;34(18):3214\u20133216.","DOI":"10.1093\/bioinformatics\/bty314"},{"issue":"13","key":"284_CR42","doi-asserted-by":"publisher","first-page":"2056","DOI":"10.1093\/bioinformatics\/btw105","volume":"32","author":"E Jacox","year":"2016","unstructured":"Jacox E, Chauve C, Sz\u00f6ll\u0151si GJ, Ponty Y, Scornavacca C. ecceTERA: comprehensive gene tree-species tree reconciliation using parsimony. Bioinformatics. 2016;32(13):2056\u20138.","journal-title":"Bioinformatics."},{"key":"284_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1748-7188-5-16","volume":"5","author":"C Conow","year":"2010","unstructured":"Conow C, Fielder D, Ovadia Y, Libeskind-Hadas R. Jane: a new tool for the cophylogeny reconstruction problem. Algorithms Mol Biol. 2010;5:1\u201310.","journal-title":"Algorithms Mol Biol."},{"issue":"2","key":"284_CR44","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1093\/sysbio\/syv082","volume":"65","author":"D Mallo","year":"2016","unstructured":"Mallo D, de Oliveira Martins L, Posada D. SimPhy: phylogenomic simulation of gene, locus, and species trees. Syst Biol. 2016;65(2):334\u201344.","journal-title":"Syst Biol."},{"issue":"3","key":"284_CR45","doi-asserted-by":"publisher","first-page":"276","DOI":"10.3390\/software1030013","volume":"1","author":"D Schaller","year":"2022","unstructured":"Schaller D, Hellmuth M, Stadler PF. AsymmeTree: a flexible python package for the simulation of complex gene family histories. Software. 2022;1(3):276\u201398.","journal-title":"Software."},{"key":"284_CR46","doi-asserted-by":"crossref","unstructured":"Batut B, Parsons DP, Fischer S, Beslon G, Knibbe C. In silico experimental evolution: a tool to test evolutionary scenarios. In: BMC bioinformatics. vol.\u00a014. Springer; 2013. p. 1\u201311.","DOI":"10.1186\/1471-2105-14-S15-S11"},{"issue":"4","key":"284_CR47","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1093\/bioinformatics\/btz710","volume":"36","author":"AA Dav\u00edn","year":"2020","unstructured":"Dav\u00edn AA, Tricou T, Tannier E, de Vienne DM, Sz\u00f6ll\u0151si GJ. Zombi: a phylogenetic simulator of trees, genomes and sequences that accounts for dead linages. Bioinformatics. 2020;36(4):1286\u20138.","journal-title":"Bioinformatics."},{"issue":"12","key":"284_CR48","doi-asserted-by":"publisher","first-page":"1556","DOI":"10.1093\/bioinformatics\/btm135","volume":"23","author":"P Puigb\u00f2","year":"2007","unstructured":"Puigb\u00f2 P, Garcia-Vallv\u00e9 S, McInerney JO. TOPD\/FMTS: a new software to compare phylogenetic trees. Bioinformatics. 2007;23(12):1556\u20138.","journal-title":"Bioinformatics."},{"issue":"5","key":"284_CR49","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1111\/zsc.12231","volume":"46","author":"PA Goloboff","year":"2017","unstructured":"Goloboff PA, Arias JS, Szumik CA. Comparing tree shapes: beyond symmetry. Zool Scr. 2017;46(5):637\u201348.","journal-title":"Zool Scr."},{"issue":"3","key":"284_CR50","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1111\/j.1095-8312.1983.tb01874.x","volume":"20","author":"HM Savage","year":"1983","unstructured":"Savage HM. The shape of evolution: systematic tree topology. Biol J Linn Soc Lond. 1983;20(3):225\u201344.","journal-title":"Biol J Linn Soc Lond."},{"issue":"5","key":"284_CR51","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1089\/106652701446170","volume":"7","author":"V Makarenkov","year":"2000","unstructured":"Makarenkov V, Leclerc B. Comparison of additive trees using circular orders. J Comput Biol. 2000;7(5):731\u201344.","journal-title":"J Comput Biol."},{"key":"284_CR52","doi-asserted-by":"crossref","unstructured":"Munzner T, Guimbreti\u00e8re F, Tasiran S, Zhang L, Zhou Y. TreeJuxtaposer. In: ACM SIGGRAPH 2003 Papers. New York, NY, USA: ACM; 2003. .","DOI":"10.1145\/1201775.882291"},{"issue":"4","key":"284_CR53","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1089\/cmb.2023.0338","volume":"31","author":"S Wagle","year":"2024","unstructured":"Wagle S, Markin A, G\u00f3recki P, Anderson TK, Eulenstein O. Asymmetric cluster-based measures for comparative phylogenetics. J Comput Biol. 2024;31(4):312\u201327. https:\/\/doi.org\/10.1089\/cmb.2023.0338.","journal-title":"J Comput Biol."},{"key":"284_CR54","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ipl.2018.04.001","volume":"136","author":"KT Huber","year":"2018","unstructured":"Huber KT, Moulton V, Sagot MF, Sinaimeri B. Geometric medians in reconciliation spaces of phylogenetic trees. Inf Process Lett. 2018;136:96\u2013101. https:\/\/doi.org\/10.1016\/j.ipl.2018.04.001.","journal-title":"Inf Process Lett."},{"key":"284_CR55","doi-asserted-by":"publisher","unstructured":"Briand S, Dessimoz C, El-Mabrouk N, Lafond M, Lobinska G. A generalized Robinson-Foulds distance for labeled trees. BMC Genomics. 2020 Nov;21(S10). https:\/\/doi.org\/10.1186\/s12864-020-07011-0.","DOI":"10.1186\/s12864-020-07011-0"},{"issue":"6","key":"284_CR56","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.1093\/sysbio\/syac028","volume":"71","author":"S Briand","year":"2022","unstructured":"Briand S, Dessimoz C, El-Mabrouk N, Nevers Y. A linear time solution to the labeled Robinson-Foulds distance problem. Syst Biol. 2022;71(6):1391\u2013403.","journal-title":"Syst Biol."},{"issue":"4","key":"284_CR57","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1109\/TCBB.2011.157","volume":"9","author":"Y Lin","year":"2011","unstructured":"Lin Y, Rajan V, Moret BM. A metric for phylogenetic trees based on matching. IEEE\/ACM Trans Comput Biol Bioinform. 2011;9(4):1014\u201322.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform."},{"issue":"1","key":"284_CR58","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13015-024-00252-8","volume":"19","author":"P G\u00f3recki","year":"2024","unstructured":"G\u00f3recki P, Rutecka N, Mykowiecka A, Paszek J. Unifying duplication episode clustering and gene-species mapping inference. Algorithms Mol Biol. 2024;19(1):1\u201320.","journal-title":"Algorithms Mol Biol."},{"key":"284_CR59","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez AL, Ram\u00edrez-Rafael JA, Flores-Lamas A, Hern\u00e1ndez-Rosales M, Lafond M. The Path-Label Reconciliation (PLR) Dissimilarity Measure for Gene Trees. In: Pissis SP, Sung W, editors. 24th International Workshop on Algorithms in Bioinformatics, WABI 2024, September 2-4, 2024, Royal Holloway, London, United Kingdom. vol. 312 of LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik; 2024. p. 20:1\u201320:21. https:\/\/doi.org\/10.4230\/LIPIcs.WABI.2024.20.","DOI":"10.1186\/s13015-025-00284-8"},{"issue":"06","key":"284_CR60","doi-asserted-by":"publisher","first-page":"1740007","DOI":"10.1142\/S0219720017400078","volume":"15","author":"E Kuitche","year":"2017","unstructured":"Kuitche E, Lafond M, Ouangraoua A. Reconstructing protein and gene phylogenies using reconciliation and soft-clustering. J Bioinform Comput Biol. 2017;15(06):1740007.","journal-title":"J Bioinform Comput Biol."},{"key":"284_CR61","doi-asserted-by":"publisher","unstructured":"N\u00f8jgaard N, Gei\u00df M, Merkle D, Stadler PF, Wieseke N, Hellmuth M. Time-consistent reconciliation maps and forbidden time travel. Algorithms Mol Biol. 2018;13(1). https:\/\/doi.org\/10.1186\/s13015-018-0121-8.","DOI":"10.1186\/s13015-018-0121-8"},{"key":"284_CR62","doi-asserted-by":"crossref","unstructured":"Lafond M, Swenson KM, El-Mabrouk N. Error detection and correction of gene trees. Models and algorithms for genome evolution. 2013;p. 261\u2013285.","DOI":"10.1007\/978-1-4471-5298-9_12"},{"issue":"1\u20132","key":"284_CR63","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s00285-012-0525-x","volume":"66","author":"M Hellmuth","year":"2012","unstructured":"Hellmuth M, Hernandez-Rosales M, Huber KT, Moulton V, Stadler PF, Wieseke N. Orthology relations, symbolic ultrametrics, and cographs. J Math Biol. 2012;66(1\u20132):399\u2013420. https:\/\/doi.org\/10.1007\/s00285-012-0525-x.","journal-title":"J Math Biol."},{"issue":"5","key":"284_CR64","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1007\/s00285-020-01469-y","volume":"80","author":"M Gei\u00df","year":"2020","unstructured":"Gei\u00df M, Laffitte MEG, S\u00e1nchez AL, Valdivia DI, Hellmuth M, Rosales MH, et al. Best match graphs and reconciliation of gene trees with species trees. J Math Biol. 2020;80(5):1459\u201395. https:\/\/doi.org\/10.1007\/s00285-020-01469-y.","journal-title":"J Math Biol."},{"key":"284_CR65","doi-asserted-by":"crossref","unstructured":"Bender MA, Farach-Colton M. The LCA problem revisited. In: LATIN 2000: theoretical informatics: 4th Latin American Symposium, Punta del Este, Uruguay, April 10\u201314, 2000 Proceedings 4. Springer; 2000. p. 88\u201394.","DOI":"10.1007\/10719839_9"},{"issue":"3","key":"284_CR66","doi-asserted-by":"publisher","first-page":"276","DOI":"10.3390\/software1030013","volume":"1","author":"D Schaller","year":"2022","unstructured":"Schaller D, Hellmuth M, Stadler PF. AsymmeTree: a flexible Python package for the simulation of complex gene family histories. Software. 2022;1(3):276\u201398.","journal-title":"Software."},{"key":"284_CR67","doi-asserted-by":"publisher","unstructured":"Kundu S, Bansal MS. SaGePhy: an improved phylogenetic simulation framework for gene and subgene evolution. Bioinformatics. 2019 02;35(18):3496\u20133498. https:\/\/doi.org\/10.1093\/bioinformatics\/btz081. https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/35\/18\/3496\/48975233\/bioinformatics_35_18_3496.pdf.","DOI":"10.1093\/bioinformatics\/btz081"},{"issue":"07","key":"284_CR68","doi-asserted-by":"publisher","first-page":"1250043","DOI":"10.1142\/S0219525912500439","volume":"15","author":"S Keller-Schmidt","year":"2012","unstructured":"Keller-Schmidt S, Klemm K. A model of macroevolution as a branching process based on innovations. Adv Complex Syst. 2012;15(07):1250043.","journal-title":"Adv Complex Syst."},{"key":"284_CR69","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-031-58072-7_5","volume-title":"Comparative genomics","author":"JA Ram\u00edrez-Rafael","year":"2024","unstructured":"Ram\u00edrez-Rafael JA, Korchmaros A, Avi\u00f1a-Padilla K, L\u00f3pez S\u00e1nchez A, Espa\u00f1a-Tinajero AA, Hellmuth M, et al. REvolutionH-tl: reconstruction of evolutionary histories tool. In: Scornavacca C, Hern\u00e1ndez-Rosales M, editors., et al., Comparative genomics. Cham: Springer Nature Switzerland; 2024. p. 89\u2013109."},{"key":"284_CR70","doi-asserted-by":"crossref","unstructured":"Yule GU. II.-A mathematical theory of evolution, based on the conclusions of Dr JC Willis, FR S. Phil Trans R Soc Lond Ser B, containing papers of a biological character. 1925;213(402-410):21\u201387.","DOI":"10.1098\/rstb.1925.0002"},{"issue":"1","key":"284_CR71","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/aoms\/1177730285","volume":"19","author":"DG Kendall","year":"1948","unstructured":"Kendall DG. On the generalized\u2019\u2019 birth-and-death\u2019\u2019 process. Ann Math Stat. 1948;19(1):1\u201315.","journal-title":"Ann Math Stat"},{"issue":"5","key":"284_CR72","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1093\/sysbio\/syr029","volume":"60","author":"T Stadler","year":"2011","unstructured":"Stadler T. Simulating trees with a fixed number of extant species. Syst Biol. 2011;60(5):676\u201384.","journal-title":"Syst Biol."},{"issue":"07","key":"284_CR73","doi-asserted-by":"publisher","first-page":"1250043","DOI":"10.1142\/S0219525912500439","volume":"15","author":"S Keller-Schmidt","year":"2012","unstructured":"Keller-Schmidt S, Klemm K. A model of macroevolution as a branching process based on innovations. Adv Complex Syst. 2012;15(07):1250043.","journal-title":"Adv Complex Syst."},{"issue":"3","key":"284_CR74","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1093\/bioinformatics\/8.3.275","volume":"8","author":"DT Jones","year":"1992","unstructured":"Jones DT, Taylor WR, Thornton JM. The rapid generation of mutation data matrices from protein sequences. Bioinformatics. 1992;8(3):275\u201382.","journal-title":"Bioinformatics."},{"key":"284_CR75","doi-asserted-by":"publisher","unstructured":"Stamatakis A. RAxML version 8: a tool for phylogenetic analysis and post-analysis of large phylogenies. Bioinformatics. 2014 01;30(9):1312\u20131313. https:\/\/doi.org\/10.1093\/bioinformatics\/btu033. https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/30\/9\/1312\/48923136\/bioinformatics_30_9_1312.pdf.","DOI":"10.1093\/bioinformatics\/btu033"},{"key":"284_CR76","doi-asserted-by":"crossref","unstructured":"Lafond M, Swenson KM, El-Mabrouk N. In: An optimal reconciliation algorithm for gene trees with polytomies. Springer Berlin Heidelberg; 2012. p. 106\u2013122.  http:\/\/dx.doi.org\/10.1007\/978-3-642-33122-0_9.","DOI":"10.1007\/978-3-642-33122-0_9"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-025-00284-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13015-025-00284-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-025-00284-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T17:11:01Z","timestamp":1757437861000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/s13015-025-00284-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,19]]},"references-count":76,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["284"],"URL":"https:\/\/doi.org\/10.1186\/s13015-025-00284-8","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,19]]},"assertion":[{"value":"1 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"16"}}