Cited by 46Bioinformatics and Genomic NetworksComplex Network Analysis TechniquesGene Regulatory Network Analysis

Higher-order molecular organization as a source of biological function

Open access
Gaudelet, Thomas, Malod-Dognin, Noël, Pržulj, Nataša·2018·Bioinformatics

Abstract

Motivation: Molecular interactions have widely been modelled as networks. The local wiring patterns around molecules in molecular networks are linked with their biological functions. However, networks model only pairwise interactions between molecules and cannot explicitly and directly capture the higher-order molecular organization, such as protein complexes and pathways. Hence, we ask if hypergraphs (hypernetworks), that directly capture entire complexes and pathways along with protein-protein interactions (PPIs), carry additional functional information beyond what can be uncovered from networks of pairwise molecular interactions. The mathematical formalism of a hypergraph has long been known, but not often used in studying molecular networks due to the lack of sophisticated algorithms for mining the underlying biological information hidden in the wiring patterns of molecular systems modelled as hypernetworks. Results: We propose a new, multi-scale, protein interaction hypernetwork model that utilizes hypergraphs to capture different scales of protein organization, including PPIs, protein complexes and pathways. In analogy to graphlets, we introduce hypergraphlets, small, connected, non-isomorphic, induced sub-hypergraphs of a hypergraph, to quantify the local wiring patterns of these multi-scale molecular hypergraphs and to mine them for new biological information. We apply them to model the multi-scale protein networks of bakers yeast and human and show that the higher-order molecular organization captured by these hypergraphs is strongly related to the underlying biology. Importantly, we demonstrate that our new models and data mining tools reveal different, but complementary biological information compared with classical PPI networks. We apply our hypergraphlets to successfully predict biological functions of uncharacterized proteins. Availability and implementation: Code and data are available online at http://www0.cs.ucl.ac.uk/staff/natasa/hypergraphlets.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1093/bioinformatics/bty570

Cites

51 of 51 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Gaudelet et al. modeled pairwise protein interactions, complexes, and pathways as multiscale hypernetworks, and analysis of these hypergraphs resulted in determining protein function for many uncharacterized genes.

    “For example, Gaudelet et al. modeled pairwise protein interactions, complexes, and pathways as multiscale hypernetworks; analysis of these hypergraphs resulted in determining protein function for many uncharacterized genes (Gaudelet et al., 2018).”

    From Mapping the multiscale structure of biological systems (2021) · cites this paper as Gaudelet et al., 2018

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 1

  1. Bellaachia,A. and Al-Dhelaan,M. (2013) Random walks in hypergraph. In: Proceedings of the 2013 International Conference on Applied Mathematics and Computational Methods, Venice, Italy, pp. 187-194.

Cited by

Sorted by citations

Authors
Gaudelet, T., Malod-Dognin, N., & Pržulj, N.
Affiliations
  • University College London (GB)
  • Department of Computer Science, University College London, London, UK
Corresponding author
Pržulj, Nataša
Venue
Bioinformatics
Published
2018-09-01
Volume
34
Issue
17
Pages
i944-i953
ISSN
  • 1367-4803 (ISSN-L)
  • 1367-4811
OpenAlex
W2797439180
Cited by
46
References
51
Citations by year
2026: 5 · 2025: 6 · 2024: 8 · 2023: 9 · 2022: 6 · 2021: 3 · 2020: 6 · 2019: 2 · 2018: 1
FWCI
1.07
Type
journal article
Language
en
Open access
Locations
  • Bioinformatics (publishedVersion)
  • Europe PMC (PubMed Central) (publishedVersion)
  • PubMed Central (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • UCL Discovery (University College London) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • UCL Computer Science
  • European Research Council
  • ERC (770827)
  • Starting Independent Researcher (278212)
  • Serbian Ministry of Education and Science Project (III44006)
  • Slovenian Research Agency
  • Farr Institute of Health Informatics Research
  • Medical Research Council, Arthritis Research UK
  • British Heart Foundation, Cancer Research UK
  • Chief Scientist Office
  • Economic and Social Research Council
  • Engineering and Physical Sciences Research Council
  • National Institute for Health Research
  • National Institute for Social Care and Health Research
  • Wellcome Trust (MR/K006584/1)
  • Medical Research Council (MC_U12266B)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Bioinformatics and Genomic Networks
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Gene Regulatory Network Analysis
Keywords
hypergraphs, hypernetworks, protein-protein interaction, protein complexes, biological pathways, protein function prediction, yeast, human
MeSH terms
Algorithms, Humans, Proteins, Saccharomyces cerevisiae, Protein Interaction Mapping

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review