BIFO: A Biological Information Flow Ontology for Directed Propagation in Heterogeneous Biomedical Knowledge Graphs
Deanne M. TayloriD, Taha Mohseni AhooyiiD, Benjamin J. SteariD, Yuanchao Zhang, Aditya LahiriiD, J. Alan Simmons, Asif ChinwallaiD, Chris NemarichiD, Tiffany J. CallahaniD, Jonathan C. SilversteiniD
Abstract
Biomedical knowledge graphs integrate heterogeneous data by connecting many entity types through many relationship types. Computational analyses that propagate signal across these graphs (random walks, diffusion, and message passing) implicitly assume that every traversable edge can carry a biological signal. In a heterogeneous KG this is rarely true: hierarchical, lexical, and purely statistical edges do not, by themselves, define an admissible directed state transformation, and traversing them propagates signal along paths that are not biologically meaningful. We present the Biological Information Flow Ontology (BIFO), a graph-agnostic specification of which directed transformations are biologically admissible for computable information flow. BIFO defines fourteen entity classes, a taxonomy of flow classes organized around the backbone G+CH [->]RNA [->]P [->]PW [->]C [->]PH [->]DS, a set of admissibility constraints, and a two-level CURIE mapping that can be applied without schema-specific code to any graph whose identifiers and predicates are resolvable through, or extendable to, the BIFO mapping tables. A four-step conditioning protocol converts a raw property graph into a conditioned propagation graph in which only admissible, direction-aware edges remain. We provide a reference implementation on the Data Distillery Knowledge Graph (DDKG); conditioning a cohort-independent, gene-anchored subgraph as a BIFO substrate of 33.6 million edges retained 23.7 million (70.7%) as BIFO-classified relationships, cleanly separating 13.3 million propagating mechanistic edges from 10.5 million retained-but-non-propagating observational associations, and confirming that pathway concepts are configured as scoring accumulation endpoints for BIFO-PPR pathway scoring. BIFO is an admissibility specification for computable propagation of signal over knowledge graphs. It is released as an open specification with versioned mapping tables and tooling, providing a reusable substrate for biologically interpretable, direction-aware analysis of biomedical knowledge graphs.
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 0
- Research Focus
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
- Biological Insights Knowledge Graph: an integrated knowledge graph to support drug development
David Geleta, Andriy Nikolov, … Eliseo Papa·bioRxiv·Oct 28, 2021
- BioKEEN: A library for learning and evaluating biological knowledge graph embeddings
Mehdi Ali, Charles Tapley Hoyt, … Hajira Jabeen·BioinformaticsPeer-reviewed·Feb 15, 2019
- Automating Biomedical Knowledge Graph Construction For Context-Aware Scientific Inference
Yikai Zheng, Wanquan Liu, … Yixue Li·bioRxiv·Aug 21, 2026
- BionetBF: A Novel Bloom Filter for Faster Membership Identification of Large Biological Graph
Sabuzima Nayak, Ripon Patgiri·bioRxiv·Sep 23, 2021
- Ozymandias: A biodiversity knowledge graph
Roderic Page·PeerJPeer-reviewed·Apr 8, 2019
- ddkg.skill: A Compositional Agent Skill for Translating Biomedical and Bioinformatics Questions into Cypher for the Data Distillery Knowledge Graph
Deanne M. Taylor, Aditya M. Lahiri, … Jonathan C. Silverstein·bioRxiv·Oct 7, 2026