= Maximum agreement subtree problem
{wiki=Maximum_agreement_subtree_problem}
The Maximum Agreement Subtree (MAST) problem is a computational problem in the field of comparative genomics and bioinformatics. It involves identifying a subtree that is common to multiple phylogenetic trees (or evolutionary trees) that represent the relationships between a given set of species or taxa. Specifically, the goal is to find a subtree that maximizes the number of leaves (species) that are consistent across the input trees.
Back to article page
