Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
Given two dendrograms (rooted tree diagrams) which have some but not all of their base points in common, a supertree is a dendrogram from which each of the original trees can be regarded as samples. The distinction is made between inconsistent and consistent sample trees, defined by whether or not the samples provide contradictory information about the supertree. An algorithm for obtaining the strict consensus supertree of two consistent sample trees is presented, as are procedures for merging two inconsistent sample trees. Some suggestions for future work are made.
scientific article; zbMATH DE number 4011681