Skip to content
DraconiticResearch
Search Sources API
197,788 studies31 sourcesUpdated 6 min ago
PreprintCC BY-NC-NDbioRxiv

BFWalk: backtrack-free network propagation with in-degree normalization

  1. 1Univ. Grenoble Alpes, CNRS, UMR 5525, BCM, TIMC, 38000, Grenoble, France

Abstract

In network medicine, the protein-protein interaction network, or interactome, is an essential resource for identifying candidate proteins underlying diseases and other phenotypic traits. Indeed, it can be leveraged via the guilt-by-association paradigm, which asserts that interacting proteins are likely to participate in the same molecular processes. Network propagation that combines the topology of the interactome with prior knowledge about disease genes is a promising strategy to identify new candidate genes contributing to diseases. However, existing network propagation algorithms are often biased toward highly connected proteins, called "hubs". We present BFWalk, a novel network propagation algorithm designed to avoid inflated scores for hubs. We tested BFWalk across four human phenotypes: multiple morphological abnormalities of the sperm flagella, dyschromatopsia, hypertrophic cardiomyopathy, and chronic kidney disease. For each phenotype, we assessed whether BFWalk could recover known phenotype-associated genes and whether new candidate genes were enriched in relevant tissues. Depending on the phenotype, BFWalk outperformed or matched the state-of-the-art network propagation methods. Furthermore, the results confirmed that BFWalk is free of bias toward high-degree nodes. Therefore, BFWalk is a powerful method for identifying new genes across diverse phenotypes and constitutes a strong alternative to existing network propagation algorithms. Availability: BFWalk is implemented in Python and C. The code is available under the GNU GPL (v3.0) on: https://github.com/jedrzejkubica/BFWalk

Related

  1. VARION: A Network Propagation Framework for Individual Patient Somatic Mutation Interpretation in Cancer Molecular Subtyping
    T. Kwon, Y.-G. Park, J.-G. Choi
    bioRxivPreprintAll rights reservedFull textBioinformatics & computational biologybioRxiv
  2. Stochastic evolutionary dynamics in structured populations: Network degree governs evolutionary stability
    Vikash Kumar Dubey, Sagar Chakraborty
    arXivPreprintarXiv licenceFull textBioinformatics & computational biologyEvolutionary biologyarXiv
  3. Protocol for Discovering Convergent Molecular Networks across Multi-Omics Datasets Using Network Propagation
    Charles O. Olwal, Declan M. Winters, Immy A. Ashley +9
    arXivPreprintCC BY 4.0Full textSystems & synthetic biologyarXiv
  4. Why rescue-based transcript ranking can mislead: normalization displacement and shared-control coupling in perturbation transcriptomics
    H. M. Jamil, A. Gow
    bioRxivPreprintAll rights reservedFull textBioinformatics & computational biologybioRxiv
  5. Ameliorative Mechanisms of ZnO Nanoparticles in Salinity-Stressed Basil Callus: From Redox Defense to Metabolomic Normalization
    Dilruba Tabay Sümbül, Damla Turan Büyükdinç, Aysel Özcan Aykutlu
    Plants (Basel, Switzerland)Peer-reviewedCC BYFull textPlant biologyEurope PMC
BibTeX
@misc{kubica2026bfwalk,
  title = {{BFWalk: backtrack-free network propagation with in-degree normalization}},
  author = {J. Kubica and D. Plewczynski and S. Dejean and N. Thierry-Mieg},
  howpublished = {bioRxiv},
  year = {2026},
  month = sep,
  doi = {10.64898/2026.09.22.753510},
  url = {https://www.biorxiv.org/content/10.64898/2026.09.22.753510v1},
  note = {CC BY-NC-ND},
}
RIS
TY  - UNPB
TI  - BFWalk: backtrack-free network propagation with in-degree normalization
AU  - J. Kubica
AU  - D. Plewczynski
AU  - S. Dejean
AU  - N. Thierry-Mieg
PY  - 2026
DA  - 2026/09/22
PB  - bioRxiv
DO  - 10.64898/2026.09.22.753510
UR  - https://www.biorxiv.org/content/10.64898/2026.09.22.753510v1
AB  - In network medicine, the protein-protein interaction network, or interactome, is an essential resource for identifying candidate proteins underlying diseases and other phenotypic traits. Indeed, it can be leveraged via the guilt-by-association paradigm, which asserts that interacting proteins are likely to participate in the same molecular processes. Network propagation that combines the topology of the interactome with prior knowledge about disease genes is a promising strategy to identify new candidate genes contributing to diseases. However, existing network propagation algorithms are often biased toward highly connected proteins, called "hubs". We present BFWalk, a novel network propagation algorithm designed to avoid inflated scores for hubs. We tested BFWalk across four human phenotypes: multiple morphological abnormalities of the sperm flagella, dyschromatopsia, hypertrophic cardiomyopathy, and chronic kidney disease. For each phenotype, we assessed whether BFWalk could recover known phenotype-associated genes and whether new candidate genes were enriched in relevant tissues. Depending on the phenotype, BFWalk outperformed or matched the state-of-the-art network propagation methods. Furthermore, the results confirmed that BFWalk is free of bias toward high-degree nodes. Therefore, BFWalk is a powerful method for identifying new genes across diverse phenotypes and constitutes a strong alternative to existing network propagation algorithms. Availability: BFWalk is implemented in Python and C. The code is available under the GNU GPL (v3.0) on: https://github.com/jedrzejkubica/BFWalk
ER  -