Meta-Alignment with Crumble and Prune: Partitioning very large alignment problems for performance and parallelization

Table 1 Comparison between root inference methods.

The average agreement score of Prune alignments when Maximal and Ortheus root inference methods are used. Fifty alignment problems with fifty leaf species and ~10 kilobases of sequence were used. Three underlying alignment algorithms and three different maximum sub-tree sizes were used in the comparison. The faster Maximal method performed better across all comparisons that Ortheus for this application.

ISSN: 1471-2105