Bailey TL; Elkan C MEME (Motif Search Motif Search)

From Algorithm Wiki
Revision as of 08:49, 10 April 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2}m^{2})$ == Space Complexity == $O(mn)$ 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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{2}m^{2})$

Space Complexity

$O(mn)$ 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