IEEE Transactions on Computational Biology and BioinformaticsEvolutionary BiologyPeer-reviewed journal article
Simple k-RF Metrics for Comparison of Labeled DAGs
Abstract
Causal relationships between different entities are often modeled as labeled acyclic digraphs (DAGs) in biology and healthcare, in particular for depicting the progression of malignant tumor cells. Comparison of labeled DAGs is essential for developing methods for inference and evaluation of DAG models. Therefore, a robust dissimilarity metric is critical for such comparison tasks. We introduce new dissimilarity measures for labeled DAGs by refining the k-Robinson-Foulds distance, originally defined to compare labeled trees. The new measures are defined based on the comparison of local node-induced multisets of labels. They can be used to compare DAGs with different label sets, without the need to introduce auxiliary nodes or remove existing ones.
- Citations
- 0
- FWCI
- 0.00
- Field percentile
- 15th percentile
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Metrics for Graph Comparison: A Practitioner’s Guide
Peter Wills, François G. Meyer·PLoS ONEPeer-reviewed·Feb 12, 2020
- A Linear-Time Solution to the Labeled Robinson-Foulds Distance Problem
Samuel Briand, Christophe Dessimoz, … Yannis Nevers·Systematic BiologyPeer-reviewed·Apr 14, 2022
- Comparing phylogenetic trees according to tip label categories
Michelle Kendall, Vegard Eldholm, Caroline Colijn·bioRxiv·Jan 22, 2018
- Extension of Colijn-Plazotta tree shape distance metric to unrooted trees
Alexey Anatolievich Morozov·bioRxiv·Dec 26, 2018
- Tree congruence: quantifying similarity between dendrogram topologies
S. U. Vidovic·bioRxiv·Sep 12, 2019
- The Bourque Distances for Mutation Trees of Cancers
Katharina Jahn, Niko Beerenwinkel, Louxin Zhang·Algorithms for Molecular BiologyPeer-reviewed·Jun 10, 2021