Ancestor-based and anchored triples allow polynomial-time solutions to consistency problems in phylogenetic networks, with construction of realizing DAGs and networks.
IEEE/ACM Transactions on Computational Biology and Bioinformatics 8(3):635–649, DOI 10.1109/TCBB.2010.17
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DM 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 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.
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.