Lawrence Gibbs Sampling (Motif Search Motif Search)
Jump to navigation
Jump to search
Time Complexity
$O(nm)$
Space Complexity
$O(n + m)$ words
(derived: two data structures, one uses O(n) and one uses O(m))
Description
Approximate?
Approximate
Approximation Factor:
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1993