Lawrence Gibbs Sampling (Motif Search Motif Search)
Revision as of 11:31, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == Reference == https://science.sciencemag.org/content/262/5131/208")
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