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.
Bulletin of Mathematical Biology 72(2):340–358, DOI 10.1007/s11538-009-9449-z
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
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 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.