CoChat

Inference of complex biological networks: distinguishability issues and optimization-based solutions

Open access
Szederkényi, Gábor, Banga, Julio R, Alonso, Antonio A · 2011 · BMC Systems Biology

The DOI matches its Crossref record; 97 of the 98 references it cites were found in a registry or an index.

Abstract

BACKGROUND: The inference of biological networks from high-throughput data has received huge attention during the last decade and can be considered an important problem class in systems biology. However, it has been recognized that reliable network inference remains an unsolved problem. Most authors have identified lack of data and deficiencies in the inference algorithms as the main reasons for this situation. RESULTS: We claim that another major difficulty for solving these inference problems is the frequent lack of uniqueness of many of these networks, especially when prior assumptions have not been taken properly into account. Our contributions aid the distinguishability analysis of chemical reaction network (CRN) models with mass action dynamics. The novel methods are based on linear programming (LP), therefore they allow the efficient analysis of CRNs containing several hundred complexes and reactions. Using these new tools and also previously published ones to obtain the network structure of biological systems from the literature, we find that, often, a unique topology cannot be determined, even if the structure of the corresponding mathematical model is assumed to be known and all dynamical variables are measurable. In other words, certain mechanisms may remain undetected (or they are falsely detected) while the inferred model is fully consistent with the measured data. It is also shown that sparsity enforcing approaches for determining 'true' reaction structures are generally not enough without additional prior information. CONCLUSIONS: The inference of biological networks can be an extremely challenging problem even in the utopian case of perfect experimental information. Unfortunately, the practical situation is often more complex than that, since the measurements are typically incomplete, noisy and sometimes dynamically not rich enough, introducing further obstacles to the structure/parameter estimation process. In this paper, we show how the structural uniqueness and identifiability of the models can be guaranteed by carefully adding extra constraints, and that these important properties can be checked through appropriate computation methods.

Overview

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1186/1752-0509-5-177

Cites

97 of 97 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 Positive feedback motif: original reaction graph and dense realization structure. (a) This subfigure shows the reaction graph of a gene regulation network model with positive feedback described originally in [87] and used in Example 1. (b) This subfigure shows all the mathematically possible reactions that can result in the same dynamical behaviour as the original biologically meaningful network shown in Figure 1. The core-reactions in the dense realization are shown with solid arrows, while the non-core reactions are indicated by dashed arrows.
Figure 1 Positive feedback motif: original reaction graph and dense realization structure. (a) This subfigure shows the reaction graph of a gene regulation network model with positive feedback described originally in [87] and used in Example 1. (b) This subfigure shows all the mathematically possible reactions that can result in the same dynamical behaviour as the original biologically meaningful network shown in Figure 1. The core-reactions in the dense realization are shown with solid arrows, while the non-core reactions are indicated by dashed arrows.CC BY · PubMed Central
Figure 2 Sparse realization structures for the positive feedback motif. Three different dynamically equivalent structures can be given for the positive feedback motif with the minimal number of reactions. The core and non-core reactions are indicated in the same way as in Figure 1.b.
Figure 2 Sparse realization structures for the positive feedback motif. Three different dynamically equivalent structures can be given for the positive feedback motif with the minimal number of reactions. The core and non-core reactions are indicated in the same way as in Figure 1.b.CC BY · PubMed Central
Figure 3 The effect of modifying the complex set and the parameters. (a) The core and non-core reactions of the dense realization of the positive feedback motif are shown in this subfigure with a randomly selected parametrization that is different from the one given in [87]. (b) The core and non-core reactions of the dense realization of the positive feedback motif can be seen in this subfigure when an additional complex X2 + X4 is involved into the model.
Figure 3 The effect of modifying the complex set and the parameters. (a) The core and non-core reactions of the dense realization of the positive feedback motif are shown in this subfigure with a randomly selected parametrization that is different from the one given in [87]. (b) The core and non-core reactions of the dense realization of the positive feedback motif can be seen in this subfigure when an additional complex X2 + X4 is involved into the model.CC BY · PubMed Central
Figure 4 Model of a biochemical switch in yeast cells. (a) The subfigure shows the original structure of a CRN describing a biochemical switch published in [90]. The numbering of species and rate coefficients is identical to the description in the original paper. (b) The dense realization of the network is depicted in this subfigure and contains 28 reactions, out of which only 12 belong to the set of core reactions.
Figure 4 Model of a biochemical switch in yeast cells. (a) The subfigure shows the original structure of a CRN describing a biochemical switch published in [90]. The numbering of species and rate coefficients is identical to the description in the original paper. (b) The dense realization of the network is depicted in this subfigure and contains 28 reactions, out of which only 12 belong to the set of core reactions.CC BY · PubMed Central
Figure 5 A standard repressilator structure. A repressilator structure with 5 nodes and auto-activation is shown in the figure. The mass-action type CRN model of this structure contains 51 distinct complexes and 55 reactions.
Figure 5 A standard repressilator structure. A repressilator structure with 5 nodes and auto-activation is shown in the figure. The mass-action type CRN model of this structure contains 51 distinct complexes and 55 reactions.CC BY · PubMed Central
Figure 6 A sparse gene regulation network and their structural identifiability properties. (a) This subfigure is the reproduction of one of the sparse gene regulation networks used for structural identification in [93]. The network has 11 activation (solid edges), 6 suppression (dashed edges), and 3 autoregulation links (at nodes 1, 3 and 6) with undefined sign. (b) The subfigure shows that the vast majority of the randomly generated models in the case when N = 2 and K = 2 are structurally unidentifiable, because not all nodes of the network are reachable from the perturbed one. (c) As the network becomes less sparse (N = 10, K = 3), the structural identifiability properties are quickly improving. In this case, more than 80% of the randomly generated models are structurally identifiable.
Figure 6 A sparse gene regulation network and their structural identifiability properties. (a) This subfigure is the reproduction of one of the sparse gene regulation networks used for structural identification in [93]. The network has 11 activation (solid edges), 6 suppression (dashed edges), and 3 autoregulation links (at nodes 1, 3 and 6) with undefined sign. (b) The subfigure shows that the vast majority of the randomly generated models in the case when N = 2 and K = 2 are structurally unidentifiable, because not all nodes of the network are reachable from the perturbed one. (c) As the network becomes less sparse (N = 10, K = 3), the structural identifiability properties are quickly improving. In this case, more than 80% of the randomly generated models are structurally identifiable.CC BY · PubMed Central

Verification

Claims the paper makes

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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?

Self-check

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

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

Citations

Cites

Show all 97 references

Cited by

See all 78

Metadata

Authors
Szederkényi, G., Banga, J. R., & Alonso, A. A.
Affiliations
Consejo Superior de Investigaciones Científicas (ES)
Corresponding author
  • Szederkényi, Gábor
  • Banga, Julio R
Venue
BMC Systems Biology
Published
2011
Volume
5
Issue
1
Pages
177
ISSN
1752-0509 (ISSN-L)
OpenAlex
W2122950891
Cited by
78
References
98
Citations by year
2026: 1 · 2023: 2 · 2022: 2 · 2021: 5 · 2020: 1 · 2019: 6 · 2018: 6 · 2017: 6 · 2016: 8 · 2015: 12 · 2014: 13 · 2013: 9 · 2012: 6
FWCI
3.76
Type
journal article
Language
en
Open access
Licence
cc-by
Locations
  • BMC Systems Biology (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • DIGITAL.CSIC (Spanish National Research Council (CSIC)) (submittedVersion)
  • SZTAKI Publication Repository (Hungarian Academy of Sciences) (submittedVersion)
Funders
  • European Commission (212754)
  • Eidgenössische Technische Hochschule Zürich
  • Hungarian Scientific Research Fund (K83440)
  • Ministerio de Ciencia e Innovación
  • Magyar Tudományos Akadémia Számítástechnikai és Automatizálási Kutatóintézet
  • FP7 Food, Agriculture and Fisheries, Biotechnology
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Gene Regulatory Network Analysis
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Microbial Metabolic Engineering and Bioproduction
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Bioinformatics and Genomic Networks
Keywords
biological network inference, chemical reaction networks, mass action kinetics, structural identifiability, linear programming, sparsity constraints, parameter estimation, systems biology
MeSH terms
Algorithms, Computer Simulation, Yeasts, Linear Models, Systems Biology, Gene Regulatory Networks, Metabolic Networks and Pathways

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Inference of complex biological networks: distinguishability issues and optimization-based solutions. https://app.cochat.ai/papers/10.1186/1752-0509-5-177
The paper
Szederkényi, G., Banga, J. R., & Alonso, A. A. (2011). Inference of complex biological networks: distinguishability issues and optimization-based solutions. BMC Systems Biology. https://doi.org/10.1186/1752-0509-5-177

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.