12859_2016_1365_MOESM1_ESM.pdf (8.03 kB)
Download file

Additional file 1: of A fast exact sequential algorithm for the partial digest problem

Download (8.03 kB)
journal contribution
posted on 22.12.2016, 05:00 authored by Mostafa Abbas, Hazem Bahig
Supplementary figure. Figure F1 a–c represents the behavior of the running time for BBd, BBb, and BBb2 algorithms with different values of M and fixed value of n. The values on the y-axis are in log-scale. In Figure a, the x-axis does not include the value of M = n * 10, because the running time is greater than 24 h. (PDF 8 kb)