Evidence map›Paper›PMID 28700698›Full record

ArticlePloS one2017

Suppressors of selection.

Fernando Alcalde Cuesta, Pablo González Sequeiros, Álvaro Lozano Rojo

Abstract read
In one paragraph

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

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

13 citing papers in PubMed.

  1. Article
  2. Article
  3. Fixation dynamics on hypergraphs.PLoS computational biology · 2023
    Article
  4. Categorizing update mechanisms for graph-structured metapopulations.Journal of the Royal Society, Interface · 2023
    Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. 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

3 authors.

Fernando Alcalde CuestaDepartamento de Matemáticas, Universidade de Santiago de Compostela, E-15782 Santiago de Compostela, Spain.
Pablo González SequeirosDepartamento de Didácticas Aplicadas, Facultade de Formación do Profesorado, Universidade de Santiago de Compostela, Avda. Ramón Ferreiro 10, E-27002 Lugo, Spain.
Álvaro Lozano RojoCentro Universitario de la Defensa, Academia General Militar, Ctra. Huesca s/n. E-50090 Zaragoza, Spain.ORCID http://orcid.org/0000-0002-1184-5901

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Inspired by recent works on evolutionary graph theory, an area of growing interest in mathematical and computational biology, we present examples of undirected structures acting as suppressors of selection for any fitness value r > 1. This means that the average fixation probability of an advantageous mutant or invader individual placed at some node is strictly less than that of this individual placed in a well-mixed population. This leads the way to study more robust structures less prone to invasion, contrary to what happens with the amplifiers of selection where the fixation probability is increased on average for advantageous invader individuals. A few families of amplifiers are known, although some effort was required to prove it. Here, we use computer aided techniques to find an exact analytical expression of the fixation probability for some graphs of small order (equal to 6, 8 and 10) proving that selection is effectively reduced for r > 1. Some numerical experiments using Monte Carlo methods are also performed for larger graphs and some variants.

Indexed as

Selection, GeneticSuppression, GeneticComputer SimulationModels, BiologicalNumerical Analysis, Computer-Assisted

Identifiers

PMID28700698
PMCPMC5503266

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.