Bailey TL; Elkan C MEME ( Motif Search)
Revision as of 10:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2}m^{2})$ == Space Complexity == $O(nm)$ words (Uses iterations of the EM algorithm as in (Lawrence, Reilly 1990), and thus uses similar amounts of space) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1995 == Reference == https://link.springer.com/article/10.1007/BF00993379")
Time Complexity
$O(n^{2}m^{2})$
Space Complexity
$O(nm)$ words
(Uses iterations of the EM algorithm as in (Lawrence, Reilly 1990), and thus uses similar amounts of space)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1995