The Frequent Words Problem: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:The Frequent Words Problem (The Frequent Words Problem)}} == Description == Given a string of length $n$ and in input integer $k$, determine the most frequent $k$-mers in the string, i.e. the most frequent words of length $k$. == Parameters == <pre>n: length of string k: length of words sigma: size of alphabet</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! A...") |
No edit summary |
||
| Line 6: | Line 6: | ||
== Parameters == | == Parameters == | ||
n: length of string | |||
k: length of words | k: length of words | ||
sigma: size of alphabet | |||
sigma: size of alphabet | |||
== Table of Algorithms == | == Table of Algorithms == | ||
Revision as of 12:03, 15 February 2023
Description
Given a string of length $n$ and in input integer $k$, determine the most frequent $k$-mers in the string, i.e. the most frequent words of length $k$.
Parameters
n: length of string
k: length of words
sigma: size of alphabet
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Naive solution | 1940 | $O(n)$ | $O(max(n, sigma^k)$) auxiliary | Exact | Deterministic | |
| Rabin Karp | 1987 | $O(n)$ | $O(max(n, sigma^k)$) auxiliary? | Exact | Deterministic |
Time Complexity graph
Space Complexity graph
Pareto Decades graph
References/Citation
http://bioinformaticsalgorithms.com/data/debugdatasets/replication/FrequentWordsProblem.pdf