Additional file 1 of Efficient sequential and parallel algorithms for finding edit distance based motifs

Expected number of spurious motifs. This file gives the expression for the expected number of spurious (l,d)-motifs in n random strings of length m from the alphabet ÎŁ. (PDF 143 kb