Exact characterizations and polynomial-time algorithms are given for realizing phylogenetic networks from required and forbidden LCA constraints under three variants of avoidance.
Bull Math Biol 87(3):44, DOI 10.1007/s11538-025-01419-z
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
roles
method 1polarities
use method 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.
Global lca-DAGs are characterized via join semi-lattices and forbidden topological minors, with a polynomial-time recognition algorithm.
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.
-
Global Least Common Ancestor (LCA) Networks
Global lca-DAGs are characterized via join semi-lattices and forbidden topological minors, with a polynomial-time recognition algorithm.