PMS (Motif Search Motif Search)

From Algorithm Wiki
Revision as of 10:34, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(nm^{2} \sigma)$ == Space Complexity == $O(m^{2} n)$ words (https://www-ncbi-nlm-nih-gov.ezproxy.canberra.edu.au/pmc/articles/PMC2966288/pdf/1471-2105-11-S8-S1.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2007 == Reference == https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/abstract/document/4359890")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(nm^{2} \sigma)$

Space Complexity

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

(https://www-ncbi-nlm-nih-gov.ezproxy.canberra.edu.au/pmc/articles/PMC2966288/pdf/1471-2105-11-S8-S1.pdf)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2007

Reference

https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/abstract/document/4359890

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=PMS_(Motif_Search_Motif_Search)&oldid=44481"