Permutation tests for comparative data
Saulsbury, J. G.
Show abstract
The analysis of patterns in comparative data has come to be dominated by least-squares regression, mainly as implemented in phylogenetic generalized least-squares (PGLS). This approach has two main drawbacks: it makes relatively restrictive assumptions about distributions and can only address questions about the conditional mean of one variable as a function of other variables. Here I introduce two new non-parametric constructs for the analysis of a broader range of comparative questions: phylogenetic permutation tests, based on cyclic permutations and permutations conserving phylogenetic signal. The cyclic permutation test, an extension of the restricted permutation test that performs exchanges by rotating nodes on the phylogeny, performs well within and outside the bounds where PGLS is applicable but can only be used for balanced trees. The signal-based permutation test has identical statistical properties and works with all trees. The statistical performance of these tests compares favorably with independent contrasts and surpasses that of a previously developed permutation test that exchanges closely related pairs of observations more frequently. Three case studies illustrate the use of phylogenetic permutations for quantile regression with non-normal and heteroscedastic data, testing hypotheses about morphospace occupation, and comparative problems in which the data points are not tips in the phylogeny.
Matching journals
The top 3 journals account for 50% of the predicted probability mass.
Similar papers in this journal
Similar papers in this journal
- An approximate likelihood method reveals ancient gene flow between human, chimpanzee and gorilla 94%
- The effects of host phylogenetic coverage and congruence metric on Monte Carlo-based null models of phylosymbiosis 94%
- What do ossification sequences tell us about the origin of extant amphibians? 93%
Similar papers in this journal
"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.