Memory requirements for indexing all repeats for the used data sets.

Abstract

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