Roth AlignACE (Motif Search Motif Search)

From Algorithm Wiki
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.ezproxy.canberra.edu.au/pubmed/9788350