Table 2 Algorithm complexities.
From: RecMotif: a novel fast algorithm for weak motif discovery
Algorithm | Complexity | |
|---|---|---|
Time | Space | Â |
PMSprune | O(mn2N(l, d)) | O(mn2) |
iTriplet | O(mn3pl3d2) | O(N(l, d)) |
DPCFG | O(mn3p2 + nmp3m- 6) | O(mn4p3) |
RecMotif | See Table 1 | O(m2n) |
- This table shows time and space complexities of PMSprune, iTriplet, DPCFG and RecMotif.
- *note,
