Fast compatibility testing for phylogenies with nested taxa

From MaRDI portal



Abstract: Semi-labeled trees are phylogenies whose internal nodes may be labeled by higher-order taxa. Thus, a leaf labeled Mus musculus could nest within a subtree whose root node is labeled Rodentia, which itself could nest within a subtree whose root is labeled Mammalia. Suppose we are given collection mathcalP of semi-labeled trees over various subsets of a set of taxa. The ancestral compatibility problem asks whether there is a semi-labeled tree mathcalT that respects the clusterings and the ancestor/descendant relationships implied by the trees in mathcalP. We give a ildeO(MmathcalP) algorithm for the ancestral compatibility problem, where MmathcalP is the total number of nodes and edges in the trees in mathcalP. Unlike the best previous algorithm, the running time of our method does not depend on the degrees of the nodes in the input trees.












This page was built for publication: Fast compatibility testing for phylogenies with nested taxa

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1708416)