Figure 2
Running times. Average running times on random permutations of Siepel and the ominous substrings algorithms for 100 ≤ n ≤ 1000.
Figure 2 | Algorithms for Molecular Biology
Running times. Average running times on random permutations of Siepel and the ominous substrings algorithms for 100 ≤ n ≤ 1000.
Algorithms for Molecular Biology