Data from: Efficient detection of repeating sites to accelerate phylogenetic likelihood calculations

Kobert K, Stamatakis A, Flouri T

Date Published: August 24, 2016

DOI: http://dx.doi.org/10.5061/dryad.8f0c8

 

Files in this package

Content in the Dryad Digital Repository is offered "as is." By downloading files, you agree to the Dryad Terms of Service. To the extent possible under law, the authors have waived all copyright and related or neighboring rights to this data. CC0 (opens a new window) Open Data (opens a new window)

Title Memory requirements for indexing all repeats for the used data sets.
Downloaded 11 times
Description The presented table displays the memory requirements for indexing all site repeats for each of the 10 data sets we used to evaluate our method. We have exhaustively checked all possible rootings for each parsimony tree and present the minimum, maximum and average number of entries table M must consist of.
Download suppl.pdf (102.9 Kb)
Details View File Details

When using this data, please cite the original publication:

Kobert K, Stamatakis A, Flouri T (2017) Efficient detection of repeating sites to accelerate phylogenetic likelihood calculations. Systematic Biology 66(2): 205-217. http://dx.doi.org/10.1093/sysbio/syw075

Additionally, please cite the Dryad data package:

Kobert K, Stamatakis A, Flouri T (2016) Data from: Efficient detection of repeating sites to accelerate phylogenetic likelihood calculations. Dryad Digital Repository. http://dx.doi.org/10.5061/dryad.8f0c8
Cite | Share
Download the data package citation in the following formats:
   RIS (compatible with EndNote, Reference Manager, ProCite, RefWorks)
   BibTex (compatible with BibDesk, LaTeX)

Search for data

Be part of Dryad

We encourage organizations to: