Exact characterizations and polynomial-time algorithms are given for realizing phylogenetic networks from required and forbidden LCA constraints under three variants of avoidance.
IEEE/ACM Transactions on Computational Biology and Bioinformatics 8(3):635–649, DOI 10.1109/ TCBB.2010.17
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
A collection of LCA constraints is realizable by some DAG if and only if it is realized by the canonical DAG built from the plus-closure of the constraints; the same holds for a regular phylogenetic network.
citing papers explorer
-
Inferring Phylogenetic Networks from Required and Forbidden LCA-Constraints
Exact characterizations and polynomial-time algorithms are given for realizing phylogenetic networks from required and forbidden LCA constraints under three variants of avoidance.
-
Inferring DAGs and Phylogenetic Networks from Least Common Ancestors
A collection of LCA constraints is realizable by some DAG if and only if it is realized by the canonical DAG built from the plus-closure of the constraints; the same holds for a regular phylogenetic network.