Evidence map›Paper›PMID 21342544›Full record

ArticleBMC bioinformatics2011

Maximum likelihood models and algorithms for gene tree evolution with duplications and losses.

Pawel Górecki, Gordon J Burleigh, Oliver Eulenstein

Open access · goldAbstract read
In one paragraph

Article in BMC bioinformatics, 2011. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 16 papers.

0numbers the graph read from it
0cells of the map it votes in
16citing papers in PubMed
2.5field-weighted citation impact, top 10% 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

16 citing papers in PubMed, 43 citations in OpenAlex.

  1. Orthology and near-cographs in the context of phylogenetic networks.Algorithms for molecular biology : AMB · 2025
    Article
  2. The complete mitochondrial genome ofMitochondrial DNA. Part B, Resources · 2023
    Article
  3. Article
  4. Article
  5. Isometric gene tree reconciliation revisited.Algorithms for molecular biology : AMB · 2017
    Article
  6. Article
  7. Article
  8. Review
  9. Article
  10. Refining discordant gene trees.BMC bioinformatics · 2014
    Article
  11. DrML: probabilistic modeling of gene duplications.Journal of computational biology : a journal of computational molecular cell biology · 2014
    Article
  12. Reconciliation of gene and species trees.BioMed research international · 2014
    Article
  13. Review
  14. How old is my gene?Trends in genetics : TIG · 2013
    Review
  15. Article
  16. 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 at 3 institutions in 2 countries.

Pawel GóreckiInstitute of Informatics, Warsaw University, Warsaw 02-097, Poland. gorecki@mimuw.edu.pl
Gordon J Burleigh
Oliver Eulenstein
Iowa State University · USUniversity of Florida · USUniversity of Warsaw · PL

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundThe abundance of new genomic data provides the opportunity to map the location of gene duplication and loss events on a species phylogeny. The first methods for mapping gene duplications and losses were based on a parsimony criterion, finding the mapping that minimizes the number of duplication and loss events. Probabilistic modeling of gene duplication and loss is relatively new and has largely focused on birth-death processes.

resultsWe introduce a new maximum likelihood model that estimates the speciation and gene duplication and loss events in a gene tree within a species tree with branch lengths. We also provide an, in practice, efficient algorithm that computes optimal evolutionary scenarios for this model. We implemented the algorithm in the program DrML and verified its performance with empirical and simulated data.

conclusionsIn test data sets, DrML finds optimal gene duplication and loss scenarios within minutes, even when the gene trees contain sequences from several hundred species. In many cases, these optimal scenarios differ from the lca-mapping that results from a parsimony gene tree reconciliation. Thus, DrML provides a new, practical statistical framework on which to study gene duplication.

Indexed as

AlgorithmsEvolution, MolecularGene DuplicationLikelihood FunctionsComputer SimulationGenetic SpeciationGenomeGenomicsPhylogenySoftware

Identifiers

PMID21342544
PMCPMC3044269
OpenAlexW2158692417

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.