%0 DATA
%A Mostafa, Abbas
%A Hazem, Bahig
%D 2016
%T Additional file 1: of A fast exact sequential algorithm for the partial digest problem
%U https://springernature.figshare.com/articles/Additional_file_1_of_A_fast_exact_sequential_algorithm_for_the_partial_digest_problem/4495616
%R 10.6084/m9.figshare.c.3651818_D2.v1
%2 https://ndownloader.figshare.com/files/7259294
%K Restriction site analysis
%K Digestion process
%K Partial digest problem
%K DNA
%K Bioinformatics algorithm
%K Breadth first search
%X 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)