Selecting optimal partitioning schemes for phylogenomic datasets.
Lanfear R, Calcott B, Kainer D, Mayer C, Stamatakis A. · 2014
Read Selecting optimal partitioning schemes for phylogenomic datasets. by Lanfear R, Calcott B, Kainer D, Mayer C, Stamatakis A. (2014) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/europmc-pmc4012149.txt.
Description
Robert Lanfear, Brett Calcott, David Kainer, Christoph Mayer, and Alexandros Stamatakis present faster ways to split gene data into model groups, in BMC Evolutionary Biology in 2014. Tree-of-life studies sort DNA sites into groups, called partitions, each with its own model of change. Good grouping sharpens the trees, dates, and rates that follow.
Older tools for picking the best grouping could only handle data sets with fewer than one hundred gene regions. Modern studies often hold thousands. The team built two grouping methods based on clustering like sites together. One favours raw speed on huge sets. The other, a relaxed form, ran nearly as fast and gave far better grouping scores by standard tests. Both ship in the free PartitionFinder program. The authors hope wider use will lift the quality of results drawn from very large gene data sets, which are now the norm in the field.
Catalog record
| CREATOR | Lanfear R, Calcott B, Kainer D, Mayer C, Stamatakis A. |
|---|---|
| YEAR | 2014 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 62 KB |
| LICENSE | CC BY 4.0 |
| RIGHTS | CC BY |
| SOURCE | Europe PMC |