Ancestor-based and anchored triples allow polynomial-time solutions to consistency problems in phylogenetic networks, with construction of realizing DAGs and networks.
Journal of Mathematical Biology 74(7):1729–1751, DOI 10.1007/s00285-016-1068-3
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
representative 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.
citing papers explorer
-
Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors
Ancestor-based and anchored triples allow polynomial-time solutions to consistency problems in phylogenetic networks, with construction of realizing DAGs and networks.
-
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