Roth AlignACE (Motif Search Motif Search)

From Algorithm Wiki
Revision as of 11:35, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(nm)$ == Space Complexity == $O(n + m)$ words (derived: essentially just modified Gibbs sampling) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1998 == Reference == https://www.ncbi.nlm.nih.gov/pubmed/9788350")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(nm)$

Space Complexity

$O(n + m)$ words

(derived: essentially just modified Gibbs sampling)

Description

Approximate?

Approximate

Approximation Factor:

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1998

Reference

https://www.ncbi.nlm.nih.gov/pubmed/9788350

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Roth_AlignACE_(Motif_Search_Motif_Search)&oldid=44503"