Skip to main content

Table 1 Exact algorithms for motif search

From: Efficient motif finding algorithms for large-alphabet inputs

Algorithm Time Complexity Space Complexity
SPELLER [9] O (nN2V(k, m)) O (nN2/w)
MITRA [5] O (knNV (k,m)) O (nNk)
CENSUS [20] O (knNV (k,m)) O (nNk)
Voting [8] O (nNV (k,m)) O (nV (m,k))
RISOTTO [6] O (nN2V (k,m)) O (nN2)
PMS [10] O (n2NV (k,m)) O (n2N)