Figure 3From: Efficient motif finding algorithms for large-alphabet inputsRatio between input size (nN) and the number of selected samples (I = |I|) as a function of the input length and alphabet size (planted motif problem, k = 13, m = 4). Note logarithmic scale.Back to article page