Efficient recycled algorithms for quantitative trait models on phylogenies

13Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present an efficient and flexible method for computing likelihoods for phenotypic traits on a phylogeny. The method does not resort to Monte Carlo computation but instead blends Felsenstein's discrete character pruning algorithm with methods for numerical quadrature. It is not limited to Gaussian models and adapts readily to model uncertainty in the observed trait values. Wedemonstrate the frameworkby developing efficient algorithms for likelihood calculation and ancestral state reconstruction under Wright's thresholdmodel, applying ourmethods to a data set of trait data for extrafloral nectaries across a phylogeny of 839 Fabales species.

Cite

CITATION STYLE

APA

Hiscott, G., Fox, C., Parry, M., & Bryant, D. (2016). Efficient recycled algorithms for quantitative trait models on phylogenies. Genome Biology and Evolution, 8(5), 1338–1350. https://doi.org/10.1093/gbe/evw064

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free