ArticleBioinformatics (Oxford, England)2014
Optimization strategies for fast detection of positive selection on phylogenetic trees.
Article in Bioinformatics (Oxford, England), 2014. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 14 papers.
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.
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.
Who cites it
14 citing papers in PubMed.
- Resurrection and characterization of ancestral xylose transporters enhance the capability of xylose uptake in the mixed sugar co-fermentation of Recombinant Saccharomyces cerevisiae.Bioresources and bioprocessing · 2026Article
- Beginner's Guide on the Use of PAML to Detect Positive Selection.Molecular biology and evolution · 2023Article
- Molecular basis of cycloheximide resistance in the Ophiostomatales revealed.Current genetics · 2022Article
- BASE: A novel workflow to integrate nonubiquitous genes in comparative genomics analyses for selection.Ecology and evolution · 2021Article
- EasyCodeML: A visual tool for analysis of selection using CodeML.Ecology and evolution · 2019Article
- EDEN: evolutionary dynamics within environments.Bioinformatics (Oxford, England) · 2017Article
- Detection of Pathways Affected by Positive Selection in Primate Lineages Ancestral to Humans.Molecular biology and evolution · 2017Article
- Efficient Detection of Repeating Sites to Accelerate Phylogenetic Likelihood Calculations.Systematic biology · 2017Article
- State aggregation for fast likelihood computations in molecular evolution.Bioinformatics (Oxford, England) · 2017Article
- LMAP: Lightweight Multigene Analyses in PAML.BMC bioinformatics · 2016Article
- Coev-web: a web platform designed to simulate and evaluate coevolving positions along a phylogenetic tree.BMC bioinformatics · 2015Article
- Less is more: an adaptive branch-site random effects model for efficient detection of episodic diversifying selection.Molecular biology and evolution · 2015Article
- Article
- Phylogenetic stochastic mapping without matrix exponentiation.Journal of computational biology : a journal of computational molecular cell biology · 2014Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
7 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
motivationThe detection of positive selection is widely used to study gene and genome evolution, but its application remains limited by the high computational cost of existing implementations. We present a series of computational optimizations for more efficient estimation of the likelihood function on large-scale phylogenetic problems. We illustrate our approach using the branch-site model of codon evolution.
resultsWe introduce novel optimization techniques that substantially outperform both CodeML from the PAML package and our previously optimized sequential version SlimCodeML. These techniques can also be applied to other likelihood-based phylogeny software. Our implementation scales well for large numbers of codons and/or species. It can therefore analyse substantially larger datasets than CodeML. We evaluated FastCodeML on different platforms and measured average sequential speedups of FastCodeML (single-threaded) versus CodeML of up to 5.8, average speedups of FastCodeML (multi-threaded) versus CodeML on a single node (shared memory) of up to 36.9 for 12 CPU cores, and average speedups of the distributed FastCodeML versus CodeML of up to 170.9 on eight nodes (96 CPU cores in total). AVAILABILITY AND IMPLEMENTATION: ftp://ftp.vital-it.ch/tools/FastCodeML/ CONTACT: selectome@unil.ch or nicolas.salamin@unil.ch.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.