Ancestor-based and anchored triples allow polynomial-time solutions to consistency problems in phylogenetic networks, with construction of realizing DAGs and networks.
Bull Math Biol 87(3):44, DOI 10.1007/s11538-025-01419-z
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
roles
method 1polarities
use method 1representative citing papers
Exact characterizations and polynomial-time algorithms are given for realizing phylogenetic networks from required and forbidden LCA constraints under three variants of avoidance.
Global lca-DAGs are characterized via join semi-lattices and forbidden topological minors, with a polynomial-time recognition algorithm.
citing papers explorer
No citing papers match the current filters.