Liang Cwinnower (Motif Search Motif Search)
Jump to navigation
Jump to search
Time Complexity
$O(nm^{0.5})$
Space Complexity
$O(m^{2})$ words
(Considers a graph on $O(m)$ nodes and $O(m^2)$ edges)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2003
Reference
https://www.worldscientific.com/doi/10.1142/S0219720004000466