{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T23:15:16Z","timestamp":1779405316985,"version":"3.53.1"},"publisher-location":"Cham","reference-count":37,"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_13","type":"book-chapter","created":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T22:20:45Z","timestamp":1779402045000},"page":"265-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["k-Nearest Common Leaves Algorithm for\u00a0Phylogenetic Tree Completion"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3630-2911","authenticated-orcid":false,"given":"Aleksandr","family":"Koshkarov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1818-208X","authenticated-orcid":false,"given":"Nadia","family":"Tahiri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,22]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13015-020-00166-1","volume":"15","author":"MS Bansal","year":"2020","unstructured":"Bansal, M.S.: Linear-time algorithms for phylogenetic tree completion under robinson-foulds distance. Algorithms Mol. Biol. 15, 1\u201315 (2020)","journal-title":"Algorithms Mol. Biol."},{"issue":"1","key":"13_CR2","first-page":"1","volume":"5","author":"MS Bansal","year":"2010","unstructured":"Bansal, M.S., Burleigh, J.G., Eulenstein, O., Fern\u00e1ndez-Baca, D.: Robinson-foulds supertrees. Algorithms. Mol. Biol. 5(1), 1\u201312 (2010)","journal-title":"Mol. Biol."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Latin American Symposium, Punta del Este, Uruguay, 10-14 April 2000 Proceedings 4, pp. 88\u201394. Springer (2000)","DOI":"10.1007\/10719839_9"},{"issue":"4","key":"13_CR4","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1006\/aama.2001.0759","volume":"27","author":"LJ Billera","year":"2001","unstructured":"Billera, L.J., Holmes, S.P., Vogtmann, K.: Geometry of the space of phylogenetic trees. Adv. Appl. Math. 27(4), 733\u2013767 (2001)","journal-title":"Adv. Appl. Math."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2148-8-90","volume":"8","author":"D Chen","year":"2008","unstructured":"Chen, D., Burleigh, J.G., Bansal, M.S., Fern\u00e1ndez-Baca, D.: Phylofinder: an intelligent search engine for phylogenetic tree databases. BMC Evol. Biol. 8, 1\u201311 (2008)","journal-title":"BMC Evol. Biol."},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13015-018-0124-5","volume":"13","author":"S Christensen","year":"2018","unstructured":"Christensen, S., Molloy, E.K., Vachaspati, P., Warnow, T.: Octal: optimal completion of gene trees in polynomial time. Algorithms Mol. Biol. 13(1), 1\u201318 (2018)","journal-title":"Algorithms Mol. Biol."},{"issue":"3","key":"13_CR7","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1080\/10635150701416682","volume":"56","author":"JA Cotton","year":"2007","unstructured":"Cotton, J.A., Wilkinson, M.: Majority-rule supertrees. Syst. Biol. 56(3), 445\u2013452 (2007)","journal-title":"Syst. Biol."},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1093\/sysbio\/syp032","volume":"58","author":"J Dong","year":"2009","unstructured":"Dong, J., Fern\u00e1ndez-Baca, D.: Properties of majority-rule supertrees. Syst. Biol. 58(3), 360\u2013367 (2009)","journal-title":"Syst. Biol."},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1080\/01969727408546059","volume":"4","author":"JC Dunn","year":"1974","unstructured":"Dunn, J.C.: Well-separated clusters and optimal fuzzy partitions. J. Cybern. 4(1), 95\u2013104 (1974)","journal-title":"J. Cybern."},{"key":"13_CR10","unstructured":"Grindstaff, G., Owen, M.: Geometric comparison of phylogenetic trees with different leaf sets. arXiv preprint arXiv:1807.04235 (2018)"},{"issue":"41","key":"13_CR11","doi-asserted-by":"publisher","first-page":"12764","DOI":"10.1073\/pnas.1423041112","volume":"112","author":"CE Hinchliff","year":"2015","unstructured":"Hinchliff, C.E., et al.: Synthesis of phylogeny and taxonomy into a comprehensive tree of life. PNAS 112(41), 12764\u201312769 (2015)","journal-title":"PNAS"},{"issue":"5","key":"13_CR12","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1038\/s41559-018-0515-5","volume":"2","author":"W Jetz","year":"2018","unstructured":"Jetz, W., Pyron, R.A.: The interplay of past diversification and evolutionary isolation with present imperilment across the amphibian tree of life. Nat. Ecol. Evol. 2(5), 850\u2013858 (2018)","journal-title":"Nat. Ecol. Evol."},{"issue":"7424","key":"13_CR13","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1038\/nature11631","volume":"491","author":"W Jetz","year":"2012","unstructured":"Jetz, W., Thomas, G.H., Joy, J.B., Hartmann, K., Mooers, A.O.: The global diversity of birds in space and time. Nature 491(7424), 444\u2013448 (2012)","journal-title":"Nature"},{"issue":"7","key":"13_CR14","doi-asserted-by":"publisher","first-page":"790","DOI":"10.3390\/sym16070790","volume":"16","author":"A Koshkarov","year":"2024","unstructured":"Koshkarov, A., Tahiri, N.: Novel algorithm for comparing phylogenetic trees with different but overlapping taxa. Symmetry 16(7), 790 (2024)","journal-title":"Symmetry"},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2148-11-205","volume":"11","author":"A Kupczok","year":"2011","unstructured":"Kupczok, A.: Split-based computation of majority-rule supertrees. BMC Evol. Biol. 11(1), 1\u201313 (2011)","journal-title":"BMC Evol. Biol."},{"issue":"8","key":"13_CR16","doi-asserted-by":"publisher","DOI":"10.1002\/ece3.70054","volume":"14","author":"W Li","year":"2024","unstructured":"Li, W., Koshkarov, A., Tahiri, N.: Comparison of phylogenetic trees defined on different but mutually overlapping sets of taxa: a review. Ecol. Evol. 14(8), e70054 (2024)","journal-title":"Ecol. Evol."},{"issue":"12","key":"13_CR17","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1089\/cmb.2021.0342","volume":"28","author":"M Llabr\u00e9s","year":"2021","unstructured":"Llabr\u00e9s, M., Rossell\u00f3, F., Valiente, G.: The generalized robinson-foulds distance for phylogenetic trees. J. Comput. Biol. 28(12), 1181\u20131195 (2021)","journal-title":"J. Comput. Biol."},{"issue":"11","key":"13_CR18","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1089\/cmb.2022.0212","volume":"29","author":"S Mahbub","year":"2022","unstructured":"Mahbub, S., Sawmya, S., Saha, A., Reaz, R., Rahman, M.S., Bayzid, M.S.: Quartet based gene tree imputation using deep learning improves phylogenomic analyses despite missing data. J. Comput. Biol. 29(11), 1156\u20131172 (2022)","journal-title":"J. Comput. Biol."},{"issue":"6","key":"13_CR19","doi-asserted-by":"publisher","first-page":"1532","DOI":"10.1093\/bioinformatics\/btab875","volume":"38","author":"U Mai","year":"2022","unstructured":"Mai, U., Mirarab, S.: Completing gene trees without species trees in sub-quadratic time. Bioinformatics 38(6), 1532\u20131541 (2022)","journal-title":"Bioinformatics"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"1432495","DOI":"10.3389\/fmolb.2024.1432495","volume":"11","author":"RN McArthur","year":"2024","unstructured":"McArthur, R.N., Zehmakan, A.N., Charleston, M.A., Lin, Y., Huttley, G.: Spectral cluster supertree: fast and statistically robust merging of rooted phylogenetic trees. Front. Mol. Biosci. 11, 1432495 (2024)","journal-title":"Front. Mol. Biosci."},{"issue":"1","key":"13_CR21","doi-asserted-by":"publisher","first-page":"5256","DOI":"10.1038\/s41598-022-08360-4","volume":"12","author":"A Priel","year":"2022","unstructured":"Priel, A., Tamir, B.: A vectorial tree distance measure. Sci. Rep. 12(1), 5256 (2022)","journal-title":"Sci. Rep."},{"issue":"2","key":"13_CR22","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1093\/sysbio\/syz045","volume":"69","author":"M Rabiee","year":"2020","unstructured":"Rabiee, M., Mirarab, S.: Instral: discordance-aware phylogenetic placement using quartet scores. Syst. Biol. 69(2), 384\u2013391 (2020)","journal-title":"Syst. Biol."},{"issue":"3","key":"13_CR23","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1093\/sysbio\/45.3.380","volume":"45","author":"R Real","year":"1996","unstructured":"Real, R., Vargas, J.M.: The probabilistic basis of jaccard\u2019s index of similarity. Syst. Biol. 45(3), 380\u2013385 (1996)","journal-title":"Syst. Biol."},{"key":"13_CR24","unstructured":"Ren, Y., et al.: A combinatorial method for connecting BHV spaces representing different numbers of taxa. arXiv preprint arXiv:1708.02626 (2017)"},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"DF Robinson","year":"1981","unstructured":"Robinson, D.F., Foulds, L.R.: Comparison of phylogenetic trees. Math. Biosci. 53, 131\u2013147 (1981)","journal-title":"Math. Biosci."},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","volume":"20","author":"PJ Rousseeuw","year":"1987","unstructured":"Rousseeuw, P.J.: Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J. Comput. Appl. Math. 20, 53\u201365 (1987)","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"13_CR27","doi-asserted-by":"publisher","first-page":"276","DOI":"10.3390\/software1030013","volume":"1","author":"D Schaller","year":"2022","unstructured":"Schaller, D., Hellmuth, M., Stadler, P.F.: Asymmetree: a flexible python package for the simulation of complex gene family histories. Software 1(3), 276\u2013298 (2022)","journal-title":"Software"},{"issue":"2","key":"13_CR28","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1038\/s41559-017-0448-4","volume":"2","author":"RW Stein","year":"2018","unstructured":"Stein, R.W., et al.: Global priorities for conserving the evolutionary history of sharks, rays and chimaeras. Nat. Ecol. Evol. 2(2), 288\u2013298 (2018)","journal-title":"Nat. Ecol. Evol."},{"issue":"13","key":"13_CR29","doi-asserted-by":"publisher","first-page":"3367","DOI":"10.1093\/bioinformatics\/btac326","volume":"38","author":"N Tahiri","year":"2022","unstructured":"Tahiri, N., Fichet, B., Makarenkov, V.: Building alternative consensus trees and supertrees using k-means and robinson and foulds distance. Bioinformatics 38(13), 3367\u20133376 (2022)","journal-title":"Bioinformatics"},{"key":"13_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12862-018-1163-8","volume":"18","author":"N Tahiri","year":"2018","unstructured":"Tahiri, N., Willems, M., Makarenkov, V.: A new fast method for inferring multiple consensus trees using k-medoids. BMC Evol. Biol. 18, 1\u201312 (2018)","journal-title":"BMC Evol. Biol."},{"issue":"1","key":"13_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1044731.1044732","volume":"52","author":"M Thorup","year":"2005","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. J. ACM 52(1), 1\u201324 (2005)","journal-title":"J. ACM"},{"issue":"12","key":"13_CR32","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pbio.3000494","volume":"17","author":"NS Upham","year":"2019","unstructured":"Upham, N.S., Esselstyn, J.A., Jetz, W.: Inferring the mammal tree: species-level sets of phylogenies for questions in ecology, evolution, and conservation. PLoS Biol. 17(12), e3000494 (2019)","journal-title":"PLoS Biol."},{"key":"13_CR33","doi-asserted-by":"publisher","first-page":"117693430500100","DOI":"10.1177\/117693430500100009","volume":"1","author":"JT Wang","year":"2005","unstructured":"Wang, J.T., Shan, H., Shasha, D., Piel, W.H.: Fast structural search in phylogenetic databases. Evol. Bioinform. 1, 117693430500100020 (2005)","journal-title":"Evol. Bioinform."},{"issue":"4","key":"13_CR34","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1093\/sysbio\/syu023","volume":"63","author":"C Whidden","year":"2014","unstructured":"Whidden, C., Zeh, N., Beiko, R.G.: Supertrees based on the subtree prune-and-regraft distance. Syst. Biol. 63(4), 566\u2013581 (2014)","journal-title":"Syst. Biol."},{"key":"13_CR35","unstructured":"Yao, K., Bansal, M.S.: Optimal completion and comparison of incomplete phylogenetic trees under robinson-foulds distance. In: 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"issue":"4","key":"13_CR36","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/TCBB.2018.2884459","volume":"17","author":"N Yasui","year":"2018","unstructured":"Yasui, N., Vogiatzis, C., Yoshida, R., Fukumizu, K.: Imphy: imputing phylogenetic trees with missing information using mathematical programming. IEEE\/ACM Trans. Comput. Biol. Bioinf. 17(4), 1222\u20131230 (2018)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"15","key":"13_CR37","doi-asserted-by":"publisher","first-page":"3419","DOI":"10.3390\/math11153419","volume":"11","author":"R Yoshida","year":"2023","unstructured":"Yoshida, R.: Imputing phylogenetic trees using tropical polytopes over the space of phylogenetic trees. Mathematics 11(15), 3419 (2023)","journal-title":"Mathematics"}],"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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T22:20:47Z","timestamp":1779402047000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-26891-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032268907","9783032268914"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-26891-4_13","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"}}]}}