The ⊖-distances are metrics on rooted phylogenetic networks that extend Robinson-Foulds, admit poly-time algorithms on tree-child/normal/level-1/regular networks for the ancestry version, and reduce to Vertex Cover on distinct-cluster networks.
IEEE/ACM Trans Comp Biol Bioinf 6:552–569, DOI 10.1109/TCBB.2007.70270
2 Pith papers cite this work, alongside 199 external citations. Polarity classification is still indexing.
2
Pith papers citing it
199
external citations · external index
years
2026 2representative citing papers
Introduces LCA-based i-regularization for DAGs that preserves LCAs of small leaf sets, produces regular graphs isomorphic to Hasse diagrams of lca-clusters, and characterizes its relation to normalization.
citing papers explorer
-
The $\ominus$-metric to compare phylogenetic networks
The ⊖-distances are metrics on rooted phylogenetic networks that extend Robinson-Foulds, admit poly-time algorithms on tree-child/normal/level-1/regular networks for the ancestry version, and reduce to Vertex Cover on distinct-cluster networks.
-
Regularizing and Normalizing DAGs and Phylogenetic Networks
Introduces LCA-based i-regularization for DAGs that preserves LCAs of small leaf sets, produces regular graphs isomorphic to Hasse diagrams of lca-clusters, and characterizes its relation to normalization.