Supertree

Edit links
Source: Wikipedia, the free encyclopedia.

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]

Construction methods

The construction of a supertree scales exponentially with the number of tax included; therefore for a tree of any reasonable size, it is not possible to examine every possible supertree and weigh its success at combining the input information. Heuristic methods are thus essential, although these methods may be unreliable; the result extracted is often biased or affected by irrelevant characteristics of the input data.[1]

The most well known method for supertree construction is Matrix Representation with Parsimony (MRP), in which the input source trees are represented by matrices with 0s, 1s, and ?s (i.e., each edge in each source tree defines a bipartition of the leafset into two disjoint parts, and the leaves on one side get 0, the leaves on the other side get 1, and the missing leaves get ?), and the matrices are concatenated and then analyzed using heuristics for maximum parsimony.[4] Another approach for supertree construction include a maximum likelihood version of MRP called "MRL" (matrix representation with likelihood), which analyzes the same MRP matrix but uses heuristics for maximum likelihood instead of for maximum parsimony to construct the supertree.

The

Robinson-Foulds distance is the most popular of many ways of measuring how similar a supertree is to the input trees. It is a metric for the number of clades from the input trees that are retained in the supertree. Robinson-Foulds optimization methods search for a supertree that minimizes the total (summed) Robinson-Foulds differences between the (binary) supertree and each input tree.[1] In this case the supertree can hence be view as the median of the input tree according to the Robinson-Foulds distance. Alternative approaches have been developped to infer median supertree based on different metrics, e.g relying on triplet or quartet decomposition of the trees.[5]

A recent innovation has been the construction of Maximum Likelihood supertrees and the use of "input-tree-wise" likelihood scores to perform tests of two supertrees.[6]

Additional methods include the Min Cut Supertree approach,[7] Most Similar Supertree Analysis (MSSA), Distance Fit (DFIT) and Quartet Fit (QFIT), implemented in the software CLANN.[8][9]

Application

Supertrees have been applied to produce phylogenies of many groups, notably the

eukaryotes[11] and mammals.[12] They have also been applied to larger-scale problems such as the origins of diversity, vulnerability to extinction,[13] and evolutionary models of ecological structure.[14]

Further reading

References

  1. ^
    PMID 20181274
    .
  2. ^ "Supertree: Introduction". genome.cs.iastate.edu.
  3. S2CID 122146129
    .
  4. PMID 1342924
    .
  5. PMID 20529895
    .
  6. PMID 24925766
    .
  7. doi:10.1016/S0166-218X(00)00202-X
    .
  8. PMID 15374874
    .
  9. PMID 19378143
    .
  10. PMID 14766971
    .
  11. PMID 17504772
    .
  12. S2CID 4314965
    .
  13. PMID 18695230
    .
  14. S2CID 535590
    .
Retrieved from "https://en.wikipedia.org/w/index.php?title=Supertree&oldid=1172950222"