EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Compression-based inference of network motif sets

Alexis Bénichou iD, Jean-Baptiste Masson iD, Christian L Vestergaard iD

PLOS Computational Biology · 2024

DOI: 10.1371/journal.pcbi.1012460 ↗

Kurz gefasst

Fachartikel in der Zeitschrift PLOS Computational Biology, 2024. Verfasst von Alexis Bénichou und 2 weiteren Autor:innen. Beteiligte Einrichtung: Institut Pasteur, Université Paris Cité, CNRS UMR 3751, Decision and Bayesian Computation, Paris, France. Hauptthemen laut MEDLINE: Computational Biology, Algorithms. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 110 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: L’Agence Nationale de la Recherche, Agence Nationale de la Recherche.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Physical and functional constraints on biological networks lead to complex topological patterns across multiple scales in their organization. A particular type of higher-order network feature that has received considerable interest is network motifs, defined as statistically regular subgraphs. These may implement fundamental logical and computational circuits and are referred to as “building blocks of complex networks”. Their well-defined structures and small sizes also enable the testing of their functions in synthetic and natural biological experiments. Here, we develop a framework for motif mining based on lossless network compression using subgraph contractions. This provides an alternative definition of motif significance which allows us to compare different motifs and select the collectively most significant set of motifs as well as other prominent network features in terms of their combined compression of the network. Our approach inherently accounts for multiple testing and correlations between subgraphs and does not rely on a priori specification of an appropriate null model. It thus overcomes common problems in hypothesis testing-based motif analysis and guarantees robust statistical inference. We validate our methodology on numerical data and then apply it on synaptic-resolution biological neural networks, as a medium for comparative connectomics, by evaluating their respective compressibility and characterize their inferred circuit motifs.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

Computational BiologyAlgorithmsNerve NetHumansData Compression

Autor:innen und Institutionen

  • Institut Pasteur, Université Paris Cité, CNRS UMR 3751, Decision and Bayesian Computation, Paris, France.
  • Epiméthée, Inria, Paris, France.

ORCID-Profile: Alexis Bénichou, Jean-Baptiste Masson, Christian L Vestergaard

Förderung

  • L’Agence Nationale de la Recherche
  • Agence Nationale de la Recherche

Zitieren

APA

Bénichou, A., Masson, J. B., & Vestergaard, C. L. (2024). Compression-based inference of network motif sets. PLOS Computational Biology. https://doi.org/10.1371/journal.pcbi.1012460

Vancouver

Bénichou A, Masson JB, Vestergaard CL. Compression-based inference of network motif sets. PLOS Computational Biology. 2024. doi:10.1371/journal.pcbi.1012460

BibTeX
@article{Bnichou2024,
  author = {Bénichou, Alexis and Masson, Jean-Baptiste and Vestergaard, Christian L},
  title = {Compression-based inference of network motif sets},
  journal = {PLOS Computational Biology},
  year = {2024},
  doi = {10.1371/journal.pcbi.1012460}
}
Kostenlos starten →