Evidence map›Paper›PMID 32966329›Full record

ArticlePloS one2020

Information integration and decision making in flowering time control.

Linlin Zhao, Sarah Richards, Franziska Turck, Markus Kollmann

Abstract read
In one paragraph

Article in PloS one, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 4 papers.

0numbers the graph read from it
0cells of the map it votes in
4citing 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

4 citing papers in PubMed.

  1. Article
  2. Review
  3. Article
  4. Review
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.

Linlin ZhaoInstitute of Mathematical Modeling for Biological Systems, Heinrich-Heine-University Dusseldorf, Dusseldorf, Germany.ORCID 0000-0001-8086-2812
Sarah RichardsInstitute of Population Genetics, Heinrich-Heine-University Dusseldorf, Dusseldorf, Germany.
Franziska TurckMax-Planck Institute for Plant Breeding Research, Cologne, Germany.
Markus KollmannInstitute of Mathematical Modeling for Biological Systems, Heinrich-Heine-University Dusseldorf, Dusseldorf, Germany.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

In order to successfully reproduce, plants must sense changes in their environment and flower at the correct time. Many plants utilize day length and vernalization, a mechanism for verifying that winter has occurred, to determine when to flower. Our study used available temperature and day length data from different climates to provide a general understanding how this information processing of environmental signals could have evolved in plants. For climates where temperature fluctuation correlations decayed exponentially, a simple stochastic model characterizing vernalization was able to reconstruct the switch-like behavior of the core flowering regulatory genes. For these and other climates, artificial neural networks were used to predict flowering gene expression patterns. For temperate plants, long-term cold temperature and short-term day length measurements were sufficient to produce robust flowering time decisions from the neural networks. Additionally, evolutionary simulations on neural networks confirmed that the combined signal of temperature and day length achieved the highest fitness relative to neural networks with access to only one of those inputs. We suggest that winter temperature memory is a well-adapted strategy for plants' detection of seasonal changes, and absolute day length is useful for the subsequent triggering of flowering.

Indexed as

Models, BiologicalBiological EvolutionDecision MakingFlowersNeural Networks, ComputerTemperatureTime Factors

Identifiers

PMID32966329
PMCPMC7511014

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.