Evidence map›Paper›PMID 22689773›Full record

ArticleBioinformatics (Oxford, England)2012

Efficient algorithms for the reconciliation problem with gene duplication, horizontal transfer and loss.

Mukul S Bansal, Eric J Alm, Manolis Kellis

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2012. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 88 papers.

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

88 citing papers in PubMed.

  1. Article
  2. Arboreal networks and their underlying trees.Journal of mathematical biology · 2026
    Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Predicting horizontal gene transfers with perfect transfer networks.Algorithms for molecular biology : AMB · 2024
    Article
  12. The Theory of Gene Family Histories.Methods in molecular biology (Clifton, N.J.) · 2024
    Article
  13. Relative timing information and orthology in evolutionary scenarios.Algorithms for molecular biology : AMB · 2023
    Article
  14. Article
  15. Article
  16. Article
  17. virDTL: Viral Recombination Analysis Through Phylogenetic Reconciliation and Its Application to Sarbecoviruses and SARS-CoV-2.Journal of computational biology : a journal of computational molecular cell biology · 2023
    Article
  18. Phylogenetic reconciliation.PLoS computational biology · 2022
    Article
  19. Article
  20. Article

28 more citing papers are in PubMed but not listed here.

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.

Mukul S BansalComputer Science and Artificial Intelligence Laboratory, Department of Biological Engineering, Massachusetts Institute of Technology, Cambridge, MA 02139, USA. mukul@csail.mit.edu
Eric J Alm
Manolis Kellis

Funding

A Data Analysis Center for integration of fly and worm modENCODE datasetsRC2HG005639 · NHGRI · MASSACHUSETTS INSTITUTE OF TECHNOLOGY · PI KELLIS, MANOLIS · 2009 to 2011
$4.1M
Regulatory Morif Discovery in the Human Genome Using Comparative GenomicsR01HG004037 · NHGRI · MASSACHUSETTS INSTITUTE OF TECHNOLOGY · PI KELLIS, MANOLIS · 2007 to 2015
$3.9M
NHGRI NIH HHS R01 HG004037NHGRI NIH HHS RC2 HG005639
6 · The paper itself

Abstract

motivationGene family evolution is driven by evolutionary events such as speciation, gene duplication, horizontal gene transfer and gene loss, and inferring these events in the evolutionary history of a given gene family is a fundamental problem in comparative and evolutionary genomics with numerous important applications. Solving this problem requires the use of a reconciliation framework, where the input consists of a gene family phylogeny and the corresponding species phylogeny, and the goal is to reconcile the two by postulating speciation, gene duplication, horizontal gene transfer and gene loss events. This reconciliation problem is referred to as duplication-transfer-loss (DTL) reconciliation and has been extensively studied in the literature. Yet, even the fastest existing algorithms for DTL reconciliation are too slow for reconciling large gene families and for use in more sophisticated applications such as gene tree or species tree reconstruction.

resultsWe present two new algorithms for the DTL reconciliation problem that are dramatically faster than existing algorithms, both asymptotically and in practice. We also extend the standard DTL reconciliation model by considering distance-dependent transfer costs, which allow for more accurate reconciliation and give an efficient algorithm for DTL reconciliation under this extended model. We implemented our new algorithms and demonstrated up to 100 000-fold speed-up over existing methods, using both simulated and biological datasets. This dramatic improvement makes it possible to use DTL reconciliation for performing rigorous evolutionary analyses of large gene families and enables its use in advanced reconciliation-based gene and species tree reconstruction methods. AVAILABILITY: Our programs can be freely downloaded from http://compbio.mit.edu/ranger-dtl/.

Indexed as

AlgorithmsEvolution, MolecularGene DuplicationGene Transfer, HorizontalGene DeletionGenomicsMultigene FamilyPhylogenySoftware

Identifiers

PMID22689773
PMCPMC3371857

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.