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, alongside 17 external citations. Polarity classification is still indexing.
3
Pith papers citing it
17
external citations · OpenAlex
representative citing papers
A set of LCA constraints is realizable by a DAG exactly when it satisfies two closure conditions, and the canonical DAG constructed from its +-closure realizes it.
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 DAGs and Phylogenetic Networks from Least Common Ancestors
A set of LCA constraints is realizable by a DAG exactly when it satisfies two closure conditions, and the canonical DAG constructed from its +-closure realizes it.
- Inferring Phylogenetic Networks from Required and Forbidden LCA-Constraints