{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:30:19Z","timestamp":1742974219123,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030578206"},{"type":"electronic","value":"9783030578213"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-57821-3_12","type":"book-chapter","created":{"date-parts":[[2020,8,17]],"date-time":"2020-08-17T09:08:43Z","timestamp":1597655323000},"page":"127-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Testing the Agreement of Trees with\u00a0Internal Labels"],"prefix":"10.1007","author":[{"given":"David","family":"Fern\u00e1ndez-Baca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,18]]},"reference":[{"issue":"3","key":"12_CR1","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/0210030","volume":"10","author":"A Aho","year":"1981","unstructured":"Aho, A., Sagiv, Y., Szymanski, T., Ullman, J.: Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM J. Comput. 10(3), 405\u2013421 (1981)","journal-title":"SIAM J. Comput."},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.2307\/1222480","volume":"41","author":"BR Baum","year":"1992","unstructured":"Baum, B.R.: Combining trees as a way of combining data sets for phylogenetic inference, and the desirability of combining gene trees. Taxon 41, 3\u201310 (1992)","journal-title":"Taxon"},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1080\/10635150500541649","volume":"55","author":"V Berry","year":"2006","unstructured":"Berry, V., Semple, C.: Fast computation of supertrees for compatible phylogenies with nested taxa. Syst. Biol. 55(2), 270\u2013288 (2006)","journal-title":"Syst. Biol."},{"key":"12_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-2330-9","volume-title":"Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life. Series on Computational Biology","year":"2004","unstructured":"Bininda-Emonds, O.R.P. (ed.): Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life. Series on Computational Biology, vol. 4. Springer, Berlin (2004). https:\/\/doi.org\/10.1007\/978-1-4020-2330-9"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s00026-006-0272-z","volume":"10","author":"M Bordewich","year":"2006","unstructured":"Bordewich, M., Evans, G., Semple, C.: Extending the limits of supertree methods. Ann. Comb. 10, 31\u201351 (2006)","journal-title":"Ann. Comb."},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.tcs.2005.10.033","volume":"351","author":"D Bryant","year":"2006","unstructured":"Bryant, D., Lagergren, J.: Compatibility of unrooted phylogenetic trees is FPT. Theoret. Comput. Sci. 351, 296\u2013302 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-1-4020-2330-9_8","volume-title":"Phylogenetic supertrees: combining information to reveal the tree of life","author":"P Daniel","year":"2004","unstructured":"Daniel, P., Semple, C.: Supertree algorithms for nested taxa. In: Bininda-Emonds, O.R.P. (ed.) Phylogenetic supertrees: combining information to reveal the tree of life, pp. 151\u2013171. Kluwer, Dordrecht (2004)"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1186\/s13015-017-0099-7","volume":"12","author":"Y Deng","year":"2017","unstructured":"Deng, Y., Fern\u00e1ndez-Baca, D.: An efficient algorithm for testing the compatibility of phylogenies with nested taxa. Algorithms Mol. Biol. 12, 7 (2017)","journal-title":"Algorithms Mol. Biol."},{"issue":"8","key":"12_CR9","doi-asserted-by":"publisher","first-page":"2453","DOI":"10.1007\/s00453-017-0330-4","volume":"80","author":"Y Deng","year":"2018","unstructured":"Deng, Y., Fern\u00e1ndez-Baca, D.: Fast compatibility testing for rooted phylogenetic trees. Algorithmica 80(8), 2453\u20132477 (2018). https:\/\/doi.org\/10.1007\/s00453-017-0330-4 . http:\/\/rdcu.be\/thB1","journal-title":"Algorithmica"},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1137\/120897559","volume":"44","author":"D Fern\u00e1ndez-Baca","year":"2015","unstructured":"Fern\u00e1ndez-Baca, D., Guillemot, S., Shutters, B., Vakati, S.: Fixed-parameter algorithms for finding agreement supertrees. SIAM J. Comput. 44(2), 384\u2013410 (2015)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.3390\/a12030053","volume":"12","author":"D Fern\u00e1ndez-Baca","year":"2019","unstructured":"Fern\u00e1ndez-Baca, D., Liu, L.: Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study. Algorithms 12(3), 53 (2019)","journal-title":"Algorithms"},{"issue":"41","key":"12_CR12","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. Proc. Nat. Acad. Sci. 112(41), 12764\u201312769 (2015). https:\/\/doi.org\/10.1073\/pnas.1423041112","journal-title":"Proc. Nat. Acad. Sci."},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-319-56970-3_6","volume-title":"Research in Computational Molecular Biology","author":"J Jansson","year":"2017","unstructured":"Jansson, J., Lingas, A., Rajaby, R., Sung, W.-K.: Determining the consistency of resolved triplets and fan triplets. In: Sahinalp, S.C. (ed.) RECOMB 2017. LNCS, vol. 10229, pp. 82\u201398. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56970-3_6"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Liu, L., Fern\u00e1ndez-Baca, D.: Testing the agreement of trees with internal labels, February 2020. arXiv preprint https:\/\/arxiv.org\/abs\/2002.09725","DOI":"10.21203\/rs.3.rs-454322\/v1"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1111\/j.1096-0031.1989.tb00569.x","volume":"5","author":"WP Maddison","year":"1989","unstructured":"Maddison, W.P.: Reconstructing character evolution on polytomous cladograms. Cladistics 5, 365\u2013377 (1989)","journal-title":"Cladistics"},{"issue":"1\u20132","key":"12_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0166-218X(95)00074-2","volume":"69","author":"M Ng","year":"1996","unstructured":"Ng, M., Wormald, N.: Reconstruction of rooted trees from subtrees. Discrete Appl. Math. 69(1\u20132), 19\u201331 (1996)","journal-title":"Discrete Appl. Math."},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-1-4020-2330-9_12","volume-title":"Phylogenetic supertrees: Combining Information to Reveal the Tree of Life","author":"RM Page","year":"2004","unstructured":"Page, R.M.: Taxonomy, supertrees, and the tree of life. In: Bininda-Emonds, O.R.P. (ed.) Phylogenetic supertrees: Combining Information to Reveal the Tree of Life, pp. 247\u2013265. Kluwer, Dordrecht (2004)"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/1055-7903(92)90035-F","volume":"1","author":"MA Ragan","year":"1992","unstructured":"Ragan, M.A.: Phylogenetic inference based on matrix representation of trees. Mol. Phylogenet. Evol. 1, 53\u201358 (1992)","journal-title":"Mol. Phylogenet. Evol."},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"e3058","DOI":"10.7717\/peerj.3058","volume":"5","author":"BD Redelings","year":"2017","unstructured":"Redelings, B.D., Holder, M.T.: A supertree pipeline for summarizing phylogenetic and taxonomic information for millions of species. Peer J. 5, e3058 (2017). https:\/\/doi.org\/10.7717\/peerj.3058","journal-title":"Peer J."},{"issue":"5885","key":"12_CR20","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1126\/science.1154449","volume":"321","author":"MJ Sanderson","year":"2008","unstructured":"Sanderson, M.J.: Phylogenetic signal in the eukaryotic tree of life. Science 321(5885), 121\u2013123 (2008)","journal-title":"Science"},{"issue":"Database issue","key":"12_CR21","doi-asserted-by":"publisher","first-page":"D5","DOI":"10.1093\/nar\/gkn741","volume":"37","author":"EW Sayers","year":"2009","unstructured":"Sayers, E.W., et al.: Database resources of the national center for biotechnology information. Nucleic Acids Res. 37(Database issue), D5\u2013D15 (2009)","journal-title":"Nucleic Acids Res."},{"key":"12_CR22","volume-title":"Phylogenetics. Oxford Lecture Series in Mathematics","author":"C Semple","year":"2003","unstructured":"Semple, C., Steel, M.: Phylogenetics. Oxford Lecture Series in Mathematics. Oxford University Press, Oxford (2003)"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/boj.12385","volume":"181","author":"The Angiosperm Phylogeny Group","year":"2016","unstructured":"The Angiosperm Phylogeny Group: An update of the angiosperm phylogeny group classification for the orders and families of flowering plants: APG IV. Bot. J. Linn. Soc. 181, 1\u201320 (2016)","journal-title":"Bot. J. Linn. Soc."},{"key":"12_CR24","unstructured":"Warnow, T.: Supertree construction: opportunities and challenges. Technical report arXiv:1805.03530 ArXiV, May 2018"},{"key":"12_CR25","unstructured":"Wulff-Nilsen, C.: Faster deterministic fully-dynamic graph connectivity. In: Proceedings of the Twenty-fourth Annual ACM-SIAM Symposium on Discrete Algorithms SODA 2013, pp. 1757\u20131769. Society for Industrial and Applied Mathematics, Philadelphia (2013). http:\/\/dl.acm.org\/citation.cfm?id=2627817.2627943"}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57821-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:36:01Z","timestamp":1667820961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-57821-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030578206","9783030578213"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57821-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 August 2020","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":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isbra2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/isbra.confreg.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"131","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}