Exact characterizations and polynomial-time algorithms are given for realizing phylogenetic networks from required and forbidden LCA constraints under three variants of avoidance.
In: Markstein P, Xu Y (eds) Computational Systems Bioinformatics
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
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.