Evidence map›Paper›PMID 34252921›Full record

ArticleBioinformatics (Oxford, England)2021

Gene tree and species tree reconciliation with endosymbiotic gene transfer.

Yoann Anselmetti, Nadia El-Mabrouk, Manuel Lafond, Aïda Ouangraoua

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2021. 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. Comprehensive Analysis of the Complete Mitochondrial Genomes ofInternational journal of molecular sciences · 2026
    Article
  2. Article
  3. Predicting horizontal gene transfers with perfect transfer networks.Algorithms for molecular biology : AMB · 2024
    Article
  4. 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.

Yoann AnselmettiDépartement d'informatique, Université de Sherbrooke, 2500, boulevard de l'Université, Sherbrooke (Québec) J1K 2R1, Canada.
Nadia El-MabroukDépartement d'informatique et de recherche opérationnelle, Université de Montréal, CP 6128 succ Centre-Ville, Montréal, Québec H3C 3J7, Canada.
Manuel LafondDépartement d'informatique, Université de Sherbrooke, 2500, boulevard de l'Université, Sherbrooke (Québec) J1K 2R1, Canada.
Aïda OuangraouaDépartement d'informatique, Université de Sherbrooke, 2500, boulevard de l'Université, Sherbrooke (Québec) J1K 2R1, Canada.

Funding

Fonds de recherche Nature et Technologie, QuébecNatural Sciences and Engineering Research Council of Canada
6 · The paper itself

Abstract

motivationIt is largely established that all extant mitochondria originated from a unique endosymbiotic event integrating an α-proteobacterial genome into an eukaryotic cell. Subsequently, eukaryote evolution has been marked by episodes of gene transfer, mainly from the mitochondria to the nucleus, resulting in a significant reduction of the mitochondrial genome, eventually completely disappearing in some lineages. However, in other lineages such as in land plants, a high variability in gene repertoire distribution, including genes encoded in both the nuclear and mitochondrial genome, is an indication of an ongoing process of Endosymbiotic Gene Transfer (EGT). Understanding how both nuclear and mitochondrial genomes have been shaped by gene loss, duplication and transfer is expected to shed light on a number of open questions regarding the evolution of eukaryotes, including rooting of the eukaryotic tree.

resultsWe address the problem of inferring the evolution of a gene family through duplication, loss and EGT events, the latter considered as a special case of horizontal gene transfer occurring between the mitochondrial and nuclear genomes of the same species (in one direction or the other). We consider both EGT events resulting in maintaining (EGTcopy) or removing (EGTcut) the gene copy in the source genome. We present a linear-time algorithm for computing the DLE (Duplication, Loss and EGT) distance, as well as an optimal reconciled tree, for the unitary cost, and a dynamic programming algorithm allowing to output all optimal reconciliations for an arbitrary cost of operations. We illustrate the application of our EndoRex software and analyze different costs settings parameters on a plant dataset and discuss the resulting reconciled trees. AVAILABILITY AND IMPLEMENTATION: EndoRex implementation and supporting data are available on the GitHub repository via https://github.com/AEVO-lab/EndoRex.

Indexed as

Evolution, MolecularGene Transfer, HorizontalAlgorithmsGene DuplicationGenomePhylogenySymbiosis

Identifiers

PMID34252921
PMCPMC8312264

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.