Ancestor-based and anchored triples allow polynomial-time solutions to consistency problems in phylogenetic networks, with construction of realizing DAGs and networks.
Algorithmica 77(1):173–200, DOI 10.1007/s00453-015-0069-8
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.