Table 2.

Running times for the Hill dataset

AlgorithmAll90% fastest99% fastest1% slowest
DP833.3 s133.5 s (16.0%)437.9 s (52.6%)395.4 s (47.4%)
Sparse DP75.3 s13.9 s (18.5%)33.9 s (45.0%)41.4 s (55.0%)

Speed up11-fold10-fold13-fold10-fold
AlgorithmAll90% fastest99% fastest1% slowest
DP833.3 s133.5 s (16.0%)437.9 s (52.6%)395.4 s (47.4%)
Sparse DP75.3 s13.9 s (18.5%)33.9 s (45.0%)41.4 s (55.0%)

Speed up11-fold10-fold13-fold10-fold

We report running times in seconds and as fractions of the total running time for all instances (5151 alignments). We also report running time for the 90 and 99% fastest and for the 1% slowest alignments. For both algorithms, instances were sorted separately.

Table 2.

Running times for the Hill dataset

AlgorithmAll90% fastest99% fastest1% slowest
DP833.3 s133.5 s (16.0%)437.9 s (52.6%)395.4 s (47.4%)
Sparse DP75.3 s13.9 s (18.5%)33.9 s (45.0%)41.4 s (55.0%)

Speed up11-fold10-fold13-fold10-fold
AlgorithmAll90% fastest99% fastest1% slowest
DP833.3 s133.5 s (16.0%)437.9 s (52.6%)395.4 s (47.4%)
Sparse DP75.3 s13.9 s (18.5%)33.9 s (45.0%)41.4 s (55.0%)

Speed up11-fold10-fold13-fold10-fold

We report running times in seconds and as fractions of the total running time for all instances (5151 alignments). We also report running time for the 90 and 99% fastest and for the 1% slowest alignments. For both algorithms, instances were sorted separately.

Close
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close

This PDF is available to Subscribers Only

View Article Abstract & Purchase Options

For full access to this pdf, sign in to an existing account, or purchase an annual subscription.

Close