Supertree

A supertree is a single phylogenetic tree assembled from a combination of smaller phylogenetic trees, which may have been assembled using different datasets (e.g. morphological and molecular) or a different selection of taxa.^[1] Supertree algorithms can highlight areas where additional data would most usefully resolve any ambiguities.^[2] The input trees of a supertree should behave as samples from the larger tree.^[3]

^ Bansal, M.; Burleigh, J.; Eulenstein, O.; Fernández-Baca, D. (2010). "Robinson-Foulds supertrees". Algorithms for Molecular Biology. 5: 18. doi:10.1186/1748-7188-5-18. PMC 2846952. PMID 20181274.
^ "Supertree: Introduction". genome.cs.iastate.edu.
^ Gordon, A. (1986). "Consensus supertrees: the synthesis of rooted trees containing overlapping sets of labeled leaves". Journal of Classification. 3 (2): 335–348. doi:10.1007/BF01894195. S2CID 122146129.

[Bansal2010-1] Bansal, M.; Burleigh, J.; Eulenstein, O.; Fernández-Baca, D. (2010). "Robinson-Foulds supertrees". Algorithms for Molecular Biology. 5: 18. doi:10.1186/1748-7188-5-18. PMC 2846952. PMID 20181274.

[2] "Supertree: Introduction". genome.cs.iastate.edu.

[3] Gordon, A. (1986). "Consensus supertrees: the synthesis of rooted trees containing overlapping sets of labeled leaves". Journal of Classification. 3 (2): 335–348. doi:10.1007/BF01894195. S2CID 122146129.

[1]

[2]

[3]