Van Helden J; Rios AF; Collado-Vides J (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(mn)$ == Space Complexity == $O(m)$ words (Derived: store number of occurances for each motif of a specified length) == Description == Dyad analysis == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2000 == Reference == https://www-ncbi-nlm-nih-gov.ezproxy.canberra.edu.au/pmc/articles/PMC102821/")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(mn)$

Space Complexity

$O(m)$ words

(Derived: store number of occurances for each motif of a specified length)

Description

Dyad analysis

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2000

Reference

https://www-ncbi-nlm-nih-gov.ezproxy.canberra.edu.au/pmc/articles/PMC102821/

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Van_Helden_J;_Rios_AF;_Collado-Vides_J_(Motif_Search_Motif_Search)&oldid=47486"