Tompa M (Motif Search Motif Search)
Jump to navigation
Jump to search
Time Complexity
$O(mn)$
Space Complexity
$O(m^{2})$ words
(Requires considering an $O(m^2)*O(m^2)$ matrix with $O(m^2)$ nonzero entries, based on a DFA with $O(m^2)$ states)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1999