• Aucun résultat trouvé

Exploring New Search Algorithms and Hardware for Phylogenetics: RAxML Meets the IBM Cell

N/A
N/A
Protected

Academic year: 2021

Partager "Exploring New Search Algorithms and Hardware for Phylogenetics: RAxML Meets the IBM Cell"

Copied!
16
0
0

Texte intégral

Figure

Figure 1. Outline of lazy subtree rearrangements with cutoff procedure.
Table 1 lists the average final log likelihood values (LH-NEW, LH-OLD) for the old and new versions of the RAxML search algorithm
Figure 2. Outline of the CELL BE architecture.
Table 3 shows the execution times of the four test runs of RAxML after newviewðÞ is off-loaded and expðÞ and logðÞ functions are replaced with
+7

Références

Documents relatifs