PluMiST

PluMiST reconstructs supertrees by extracting and combining split information from overlapping input phylogenetic trees to produce unified phylogenies for evolutionary and phylogenetic analysis.

Key Features:

• Split-based methods: Extracts split information from input trees and combines those splits to build a supertree.
• Majority-Rule Supertree Methods: Implements MR(-), MR(+), and MR(+)g variants that extend majority-rule consensus methods to the supertree context for combining input trees with overlapping taxa.
• Score Computation: Provides explicit formulas for computing scores for bifurcating input trees and supertrees to evaluate compatibility and reconstruction quality.
• Heuristic Tree Search: Employs a heuristic search strategy to explore supertree space and minimize the computed scores.
• Compatibility Handling: Combines compatible input trees and includes the MR(-) variant which performs favorably when input trees are incompatible.
• Implementation: Implemented in Python.
• Testing and Validation: Methods have been evaluated using simulations and real-world datasets.
• Bifurcating focus: Current computations and scoring focus on fully resolved (bifurcating) trees, with extension to multifurcating trees noted as an open area.

Scientific Applications:

• Supertree reconstruction: Synthesize multiple phylogenetic trees into a single comprehensive tree for evolutionary studies.
• Integration of diverse datasets: Integrate overlapping phylogenetic studies to infer evolutionary relationships across taxa.

Methodology:

PluMiST extracts split information from input trees, combines splits to form candidate supertrees, and applies a heuristic search to minimize scores computed from explicit formulas tailored to bifurcating trees.