Evidence map›Paper›PMID 34175930›Full record

ArticleMolecular biology and evolution2021

Dissecting the Fitness Costs of Complex Mutations.

Pablo Yubero, Juan F Poyatos

Open access · goldAbstract read
In one paragraph

Article in Molecular biology and evolution, 2021. 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
0.5field-weighted citation impact, top 29% of its field
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, 4 citations in OpenAlex.

  1. Article
  2. Cell-cell fusion in cancer: The next cancer hallmark?The international journal of biochemistry & cell biology · 2024
    Review
  3. 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

2 authors.

Pablo YuberoLogic of Genomic Systems Laboratory, CNB-CSIC, Madrid, Spain.ORCID 0000-0002-2860-2236
Juan F PoyatosLogic of Genomic Systems Laboratory, CNB-CSIC, Madrid, Spain.ORCID 0000-0003-4575-8723

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The fitness cost of complex pleiotropic mutations is generally difficult to assess. On the one hand, it is necessary to identify which molecular properties are directly altered by the mutation. On the other, this alteration modifies the activity of many genetic targets with uncertain consequences. Here, we examine the possibility of addressing these challenges by identifying unique predictors of these costs. To this aim, we consider mutations in the RNA polymerase (RNAP) in Escherichia coli as a model of complex mutations. Changes in RNAP modify the global program of transcriptional regulation, with many consequences. Among others is the difficulty to decouple the direct effect of the mutation from the response of the whole system to such mutation. A problem that we solve quantitatively with data of a set of constitutive genes, those on which the global program acts most directly. We provide a statistical framework that incorporates the direct effects and other molecular variables linked to this program as predictors, which leads to the identification that some genes are more suitable to determine costs than others. Therefore, we not only identified which molecular properties best anticipate fitness, but we also present the paradoxical result that, despite pleiotropy, specific genes serve as more solid predictors. These results have connotations for the understanding of the architecture of robustness in biological systems.

Indexed as

DNA-Directed RNA PolymerasesEscherichia coliMutationDNA-Directed RNA Polymerasesfitness costspleiotropyRNAP

Identifiers

PMID34175930
PMCPMC8476139
OpenAlexW3175460777

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC
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.