Bad Clade Deletion Supertrees: A Fast and Accurate Supertree Algorithm.

ABSTRACT: Supertree methods merge a set of overlapping phylogenetic trees into a supertree containing all taxa of the input trees. The challenge in supertree reconstruction is the way of dealing with conflicting information in the input trees. Many different algorithms for different objective functions have been suggested to resolve these conflicts. In particular, there exist methods based on encoding the source trees in a matrix, where the supertree is constructed applying a local search heuristic to optimize the respective objective function. We present a novel heuristic supertree algorithm called Bad Clade Deletion (BCD) supertrees. It uses minimum cuts to delete a locally minimal number of columns from such a matrix representation so that it is compatible. This is the complement problem to Matri

SUBMITTER: Fleischauer M 

PROVIDER: S-EPMC5850620 | biostudies-literature | 2017 Sep

REPOSITORIES: biostudies-literature