Skip to main content
Figure 4 | BMC Bioinformatics

Figure 4

From: On finding minimal absent words

Figure 4

Total time for generating all minimal absent words for random strings. Plots of the total time required for generating all minimal absent words (including the time needed for reading the data and creating the suffix and lcp arrays), as a function of the string length, for random strings with alphabet size |Σ| = 2, 4,8, 16, 32.

Back to article page
\