Published in
Oxford University Press (OUP), Bioinformatics, 8(30), p. 1129-1137
DOI: 10.1093/bioinformatics/btt760
Links
- ORCID
- Oxford University Press (OUP) | PDF
- [www.ncbi.nlm.nih.gov] | PDF
- [serval.unil.ch] | PDF
- [doc.rero.ch] | PDF
- [europepmc.org] | PDF
- [www.researchgate.net] | PDF
- [www.ncbi.nlm.nih.gov] | PDF
- [serval.unil.ch] | PDF
Tools
Optimization strategies for fast detection of positive selection on phylogenetic trees
Journal article published in 2014 by
Mario Valle,
Hannes Schabauer,
Christoph Pacher,
Heinz Stockinger,
Alexandros Stamatakis,
Marc Robinson-Rechavi 
,
Nicolas Salamin
,
Nicolas Salamin
This paper is made freely available by the publisher.
Full text: Download
Published version:
archiving forbidden
Data provided by 
Abstract
Motivation: The 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.