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 80(3):865–953, DOI 10.1007/s00285-019-01444-2
3 Pith papers cite this work. Polarity classification is still indexing.
3
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.
Introduces LCA-based i-regularization for DAGs that preserves LCAs of small leaf sets, produces regular graphs isomorphic to Hasse diagrams of lca-clusters, and characterizes its relation to normalization.
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.
-
Regularizing and Normalizing DAGs and Phylogenetic Networks
Introduces LCA-based i-regularization for DAGs that preserves LCAs of small leaf sets, produces regular graphs isomorphic to Hasse diagrams of lca-clusters, and characterizes its relation to normalization.