Fast Computation of Supertrees for Compatible Phylogenies with Nested Taxa

摘要: Typically, supertree methods combine a collection of source trees in which just the leaves are labelled by taxa. In such resulting is also leaf-labelled. An underlying assumption these that, across all collection, no two taxa nested ; for example, "buttercups'' and "plants'' Motivated Page, first algorithm allowing to collectively have called AncestralBuild. Here, addition labelling leaves, may some their interior nodes. Taxa nodes at higher taxonomic level than that descendants (for genera versus species). Analogous method Build deciding compatibility labelled, AncestralBuild polynomial-time Although more general method, this paper we show original description can be modified so running time as fast current fastest Build. Fast computation essential if one make use phylogenetic databases contain thousands on tens This particularly AncestorBuild incorporated basic tool inside methods. We apply propose comprehensive phylogeny strepsirrhines, major group primates.