CoChat

Temporal competition between differentiation programs determines cell fate choice

Open access
Kuchina, Anna, Espinar, Lorena, Çağatay, Tolga, Balbin, Alejandro O, Zhang, Fang, Alvarado, Alma, Garcia‐Ojalvo, Jordi, Süel, Gürol M · 2011 · Molecular Systems Biology
Cited by 78

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

Abstract

Multipotent differentiation, where cells adopt one of several possible fates, occurs in diverse systems ranging from bacteria to mammals. This decision-making process is driven by multiple differentiation programs that operate simultaneously in the cell. How these programs interact to govern cell fate choice is poorly understood. To investigate this issue, we simultaneously measured activities of the competing sporulation and competence programs in single Bacillus subtilis cells. This approach revealed that these competing differentiation programs progress independently without cross-regulation before the decision point. Cells seem to arrive at a fate choice through differences in the relative timing between the two programs. To test this proposed dynamic mechanism, we altered the relative timing by engineering artificial cross-regulation between the sporulation and competence circuits. Results suggest a simple model that does not require a checkpoint or intricate cross-regulation before cellular decision-making. Rather, cell fate choice appears to be the outcome of a 'molecular race' between differentiation programs that compete in time, providing a simple dynamic mechanism for decision-making.

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.1038/msb.2011.88

Cites

2 of 2 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

Cited by

See all 78

Metadata

Authors
Kuchina, A., Espinar, L., Çağatay, T., Balbin, A. O., Zhang, F., Alvarado, A., Garcia‐Ojalvo, J., & Süel, G. M.
Venue
Molecular Systems Biology
Published
2011-01
Volume
7
Issue
1
Pages
557-557
ISSN
1744-4292 (ISSN-L)
OpenAlex
W2154049504
Cited by
78
References
2
FWCI
3.64
Type
journal article
Language
en
Open access
gold

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

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.