Exact characterizations and polynomial-time algorithms are given for realizing phylogenetic networks from required and forbidden LCA constraints under three variants of avoidance.
Journal of Mathematical Biology 83(3):28, DOI 10.1007/s00285-021-01654-7
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative 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.