Evidence map›Paper›PMID 31727996›Full record

ArticleScientific reports2019

Limit cycle dynamics can guide the evolution of gene regulatory networks towards point attractors.

Stuart P Wilson, Sebastian S James, Daniel J Whiteley, Leah A Krubitzer

Abstract read
In one paragraph

Article in Scientific reports, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

3 citing papers in PubMed.

  1. How nature discovers rare Turing islands: Exploration by common limit cycles.Proceedings of the National Academy of Sciences of the United States of America · 2026
    Article
  2. Article
  3. Scaffolding layered control architectures through constraint closure: insights into brain evolution and development.Philosophical transactions of the Royal Society of London. Series B, Biological sciences · 2022
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Stuart P WilsonDepartment of Psychology, The University of Sheffield, Sheffield, United Kingdom. S.P.Wilson@Sheffield.ac.uk.ORCID http://orcid.org/0000-0001-8125-5133
Sebastian S JamesDepartment of Psychology, The University of Sheffield, Sheffield, United Kingdom.ORCID http://orcid.org/0000-0003-0208-0588
Daniel J WhiteleyDepartment of Psychology, The University of Sheffield, Sheffield, United Kingdom.
Leah A KrubitzerCenter for Neuroscience, University of California, Davis, United States.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Developmental dynamics in Boolean models of gene networks self-organize, either into point attractors (stable repeating patterns of gene expression) or limit cycles (stable repeating sequences of patterns), depending on the network interactions specified by a genome of evolvable bits. Genome specifications for dynamics that can map specific gene expression patterns in early development onto specific point attractor patterns in later development are essentially impossible to discover by chance mutation alone, even for small networks. We show that selection for approximate mappings, dynamically maintained in the states comprising limit cycles, can accelerate evolution by at least an order of magnitude. These results suggest that self-organizing dynamics that occur within lifetimes can, in principle, guide natural selection across lifetimes.

Indexed as

Gene Regulatory NetworksAlgorithmsComputational BiologyComputer SimulationEvolution, MolecularGene Expression Regulation, DevelopmentalModels, GeneticMutationSelection, Genetic

Identifiers

PMID31727996
PMCPMC6856163

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.