CoChat

Noise characteristics of feed forward loops

Open access
Ghosh, Bhaswar, Karmakar, Rajesh, Bose, Indrani · 2005 · Physical Biology
Cited by 75

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

Abstract

A prominent feature of gene transcription regulatory networks is the presence in large numbers of motifs, i.e., patterns of interconnection, in the networks. One such motif is the feed forward loop (FFL) consisting of three genes X, Y and Z. The protein product x of X controls the synthesis of protein product y of Y. Proteins x and y jointly regulate the synthesis of z proteins from the gene Z. The FFLs, depending on the nature of the regulating interactions, can be of eight different types which can again be classified into two categories: coherent and incoherent. In this paper, we study the noise characteristics of FFLs using the Langevin formalism and the Monte Carlo simulation technique based on the Gillespie algorithm. We calculate the variances around the mean protein levels in the steady states of the FFLs and find that, in the case of coherent FFLs, the most abundant FFL, namely, the type-1 coherent FFL, is the least noisy. This is shown to be true for all parameter values when the FFLs operate above their thresholds of activation/repression. In the case of incoherent FFLs, no such general conclusion can be shown. The results suggest possible relationships between noise, functionality and abundance.

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.1088/1478-3967/2/1/005

Cites

6 of 6 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.

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

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

Cited by

See all 75

Metadata

Authors
Ghosh, B., Karmakar, R., & Bose, I.
Venue
Physical Biology
Published
2005-03
Volume
2
Issue
1
Pages
36-45
ISSN
  • 1478-3967 (ISSN-L)
  • 1478-3975
OpenAlex
W2071495240
Cited by
75
References
6
FWCI
1.73
Type
journal article
Language
en
Open access
bronze

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: Noise characteristics of feed forward loops. https://app.cochat.ai/papers/10.1088/1478-3967/2/1/005
The paper
Ghosh, B., Karmakar, R., & Bose, I. (2005). Noise characteristics of feed forward loops. Physical Biology. https://doi.org/10.1088/1478-3967/2/1/005

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.