EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

HMFGraph: Novel Bayesian approach for recovering biological networks

Aapo E Korhonen iD, Olli Sarala, Tuomas Hautamäki iD, Markku Kuismin, Mikko J Sillanpää iD

PLOS Computational Biology · 2025

DOI: 10.1371/journal.pcbi.1013614 ↗

Kurz gefasst

Fachartikel in der Zeitschrift PLOS Computational Biology, 2025. Verfasst von Aapo E Korhonen und 4 weiteren Autor:innen. Beteiligte Einrichtung: Research Unit of Mathematical Sciences, University of Oulu, Oulu, Finland. Hauptthemen laut MEDLINE: Computational Biology, Gene Regulatory Networks. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 78 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Research Council of Finland, Finnish Doctoral Program Network in Artificial Intelligence, AI-DOC, Yrjö and Kalle Väisälä Foundation.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Gaussian graphical models (GGM) are powerful tools to examine partial correlation structures in high-dimensional omics datasets. Partial correlation networks can explain complex relationships between genes or other biological variables. Bayesian implementations of GGMs have recently received more attention. Usually, the most demanding parts of GGM implementations are: (i) hyperparameter tuning, (ii) edge selection, (iii) scalability for large datasets, and (iv) the prior choice for Bayesian GGM. To address these limitations, we introduce a novel Bayesian GGM using a hierarchical matrix-F prior with a fast implementation. We show, with extensive simulations and biological example analyses, that this prior has competitive network recovery capabilities compared to state-of-the-art approaches and good properties for recovering meaningful networks. We present a new way of tuning the shrinkage hyperparameter by constraining the condition number of the estimated precision matrix. For edge selection, we propose using approximated credible intervals (CI) whose width is controlled by the false discovery rate. An optimal CI is selected by maximizing an estimated F 1 -score via permutations. In addition, a specific choice of hyperparameter can make the proposed prior better suited for clustering and community detection. Our method, with a generalized expectation-maximization algorithm, computationally outperforms existing Bayesian GGM approaches that use Markov chain Monte Carlo algorithms. The method is implemented in the R package HMFGraph , found on GitHub at https://github.com/AapoKorhonen/HMFGraph . All codes to reproduce the results are found on GitHub at https://github.com/AapoKorhonen/HMFGraph-Supplementary .

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

Computational BiologyGene Regulatory NetworksBayes TheoremAlgorithmsComputer SimulationNormal DistributionSoftwareHumans

Autor:innen und Institutionen

  • Research Unit of Mathematical Sciences, University of Oulu, Oulu, Finland.

ORCID-Profile: Aapo E Korhonen, Tuomas Hautamäki, Mikko J Sillanpää

Förderung

  • Research Council of Finland
  • Finnish Doctoral Program Network in Artificial Intelligence, AI-DOC
  • Yrjö and Kalle Väisälä Foundation
  • Finnish Doctoral Program Network in Artificial Intelligence
  • Vilho, Yrjö and Kalle Väisälä Foundation

Zitieren

APA

Korhonen, A. E., Sarala, O., Hautamäki, T., Kuismin, M., & Sillanpää, M. J. (2025). HMFGraph: Novel Bayesian approach for recovering biological networks. PLOS Computational Biology. https://doi.org/10.1371/journal.pcbi.1013614

Vancouver

Korhonen AE, Sarala O, Hautamäki T, Kuismin M, Sillanpää MJ. HMFGraph: Novel Bayesian approach for recovering biological networks. PLOS Computational Biology. 2025. doi:10.1371/journal.pcbi.1013614

BibTeX
@article{Korhonen2025,
  author = {Korhonen, Aapo E and Sarala, Olli and Hautamäki, Tuomas and Kuismin, Markku and Sillanpää, Mikko J},
  title = {HMFGraph: Novel Bayesian approach for recovering biological networks},
  journal = {PLOS Computational Biology},
  year = {2025},
  doi = {10.1371/journal.pcbi.1013614}
}
Kostenlos starten →