%0 Journal Article
%T An efficient algorithm for testing the compatibility of phylogenies with nested taxa
%A Yun Deng
%J Archive of "Algorithms for Molecular Biology : AMB".
%D 2017
%R 10.1186/s13015-017-0099-7
%X Semi-labeled trees generalize ordinary phylogenetic trees, allowing internal nodes to be labeled by higher-order taxa. Taxonomies are examples of semi-labeled trees. Suppose we are given collection £¿£¿ of semi-labeled trees over various subsets of a set of taxa. The ancestral compatibility problem asks whether there is a semi-labeled tree that respects the clusterings and the ancestor/descendant relationships implied by the trees in £¿£¿. The running time and space usage of the best previous algorithm for testing ancestral compatibility depend on the degrees of the nodes in the trees in £¿£¿
%K Algorithms
%K Phylogenetics
%K Supertrees
%K Taxonomies
%U https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5356459/