Sagot M (Motif Search Motif Search)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(n \log(n)$ m^{1.{4}5})

Space Complexity

$O(mn^{2}/w)$ words

(https://link.springer.com/chapter/10.1007/BFb0054337)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1988

Reference

https://link.springer.com/chapter/10.1007/BFb0054337