Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 306

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

Stability of Genetic Networks With SUM Regulatory Logic: Lur'e System and LMI Approach

Li, Chunguang, Chen, Luonan, Aihara, Kazuyuki·2006·IEEE Transactions on Circuits and Systems I: Regular Papers

Abstract

In this paper, we present a nonlinear model for genetic regulatory networks with SUM regulatory functions. We show that the genetic network can be transformed into Lur'e form. Based on the Lyapunov method and the Lur'e system approach, sufficient conditions for the stability of the genetic networks are derived, in particular for the cases with time delays owing to the slow processes of transcription, translation, and translocation, and for the cases with stochastic perturbations due to natural random intra- and inter-cellular fluctuations. All the stability conditions are given in terms of linear matrix inequalities (LMIs), which are very easy to be verified. To test the effectiveness of our theoretical results, several examples of genetic networks are also presented in this paper

Overview

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.1109/tcsi.2006.883882

Cites

26 of 26 references verified0 citation errors · 0 not checkable

Statistics

Verification

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

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 26 references

Metadata

Authors
Li, C., Chen, L., & Aihara, K.
Venue
IEEE Transactions on Circuits and Systems I: Regular Papers
Published
2006-11
Volume
53
Issue
11
Pages
2451-2458
ISSN
1057-7122 (ISSN-L)
OpenAlex
W2120510384
Cited by
306
References
26
FWCI
5.65
Type
journal article
Language
en
Open access
closed

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: Stability of Genetic Networks With SUM Regulatory Logic: Lur'e System and LMI Approach. https://app.cochat.ai/papers/10.1109/tcsi.2006.883882
The paper
Li, C., Chen, L., & Aihara, K. (2006). Stability of Genetic Networks With SUM Regulatory Logic: Lur'e System and LMI Approach. IEEE Transactions on Circuits and Systems I: Regular Papers. https://doi.org/10.1109/tcsi.2006.883882

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.