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):785–796, DOI 10.1109/TCBB.2010.69 31
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
A clustering system C is the hardwired clustering system of a rooted level-k network if and only if μ(B) ≤ k for every non-trivial block B in the Hasse diagram H[C].
citing papers explorer
-
A Characterization of Level-k Realizability for Clustering Systems
A clustering system C is the hardwired clustering system of a rooted level-k network if and only if μ(B) ≤ k for every non-trivial block B in the Hasse diagram H[C].