Approximate Bayesian inference of directed acyclic graphs in biology with flexible priors on edge states
PLOS Computational Biology · 16.03.2026 · 22 (3) · e1014039
DOI: 10.1371/journal.pcbi.1014039 ↗Kurz gefasst
Fachartikel in der Zeitschrift PLOS Computational Biology, online erschienen am 16.03.2026. Verfasst von Evan A Martin und 2 weiteren Autor:innen. Beteiligte Einrichtung: The Bioinformatics and Computational Biology Program, University of Idaho, Moscow, Idaho, United States of America. Hauptthemen laut MEDLINE: Computational Biology. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 64 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Institute of General Medical Sciences.
Abstract (Originalsprache)
Graphical models are widely used to represent dependence structures in biological systems, where directed edges may encode causal relationships under appropriate assumptions. We present baycn (BAYesian Causal Network), a novel approximate Bayesian method for inferring probabilities of edge directions and edge absence, while allowing flexible, user-specified priors to encode sparsity and an input graph to incorporate biological knowledge. For inference, we develop a Metropolis-Hastings-like sampler over graph structures based on a pseudo-posterior with a plug-in likelihood, which eliminates potentially high-dimensional nuisance parameters. This formulation substantially improves computational efficiency while yielding posterior probabilities that reflect Markov equivalence. We apply baycn to two genomic applications: distinguishing direct from indirect target genes of a shared genetic variant, and inferring combinatorial binding of transcription factors during tissue differentiation in Drosophila embryos. Both applications involve discrete and continuous data types that are common in genomics. Selected variables in these applications are treated as instrumental variables to help impose constraints on edge direction. Baycn demonstrates substantially improved accuracy at both the graph and edge levels, while existing methods do not handle mixed data, fail to capture weak signals, or are computationally infeasible.
Schlagwörter
MeSH-Schlagwörter (MEDLINE)
Autor:innen und Institutionen
- The Bioinformatics and Computational Biology Program, University of Idaho, Moscow, Idaho, United States of America.
- The MD-PhD Program, Wayne State University School of Medicine, Detroit, Michigan, United States of America.
- Department of Family Medicine and Public Health Sciences, Center for Molecular Medicine and Genetics, Institute for AI and Data Science, Wayne State University, Detroit, Michigan, United States of America.
ORCID-Profile: Audrey Qiuyan Fu
Förderung
- National Institute of General Medical Sciences
Zitieren
APA
Martin, E. A., Patchigolla, V., & Fu, A. Q. (2026). Approximate Bayesian inference of directed acyclic graphs in biology with flexible priors on edge states. PLOS Computational Biology, 22(3), e1014039. https://doi.org/10.1371/journal.pcbi.1014039
Vancouver
Martin EA, Patchigolla V, Fu AQ. Approximate Bayesian inference of directed acyclic graphs in biology with flexible priors on edge states. PLOS Computational Biology. 2026;22(3):e1014039. doi:10.1371/journal.pcbi.1014039
BibTeX
@article{Martin2026,
author = {Martin, Evan A and Patchigolla, Venkata and Fu, Audrey Qiuyan},
title = {Approximate Bayesian inference of directed acyclic graphs in biology with flexible priors on edge states},
journal = {PLOS Computational Biology},
year = {2026},
volume = {22},
number = {3},
pages = {e1014039},
doi = {10.1371/journal.pcbi.1014039}
}
EUVIMED