Exact characterizations and polynomial-time algorithms are given for realizing phylogenetic networks from required and forbidden LCA constraints under three variants of avoidance.
Theory in Biosciences 142(4):301–358, DOI 10.1007/s12064-023-00398-w
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative 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.
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.
-
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.
-
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.
- Inferring DAGs and Phylogenetic Networks from Least Common Ancestors