D-Neighborhood of a String: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 6: | Line 6: | ||
== Parameters == | == Parameters == | ||
n: length of string | $n$: length of string | ||
d: neighborhood distance threshold | $d$: neighborhood distance threshold | ||
sigma: size of alphabet | $\sigma$: size of alphabet | ||
== Table of Algorithms == | == Table of Algorithms == | ||
| Line 20: | Line 20: | ||
|- | |- | ||
| [[Iterative naive (d-Neighborhood of a String d-Neighborhood of a String)|Iterative naive]] || 1940 || $O(f_{bin}(sigma-{1}, n, d)$) where f_{bin}(x, y, z) = sum_{i=0}^z C(y, i)*x^i || $O(n)$ | | [[Iterative naive (d-Neighborhood of a String d-Neighborhood of a String)|Iterative naive]] || 1940 || $O(f_{bin}(sigma-{1}, n, d)$) where f_{bin}(x, y, z) = sum_{i=0}^z C(y, i)*x^i || $O(n)$ || Exact || Deterministic || [http://rosalind.info/problems/ba1n/ Time] | ||
|- | |- | ||
|} | |} | ||
Revision as of 09:24, 10 April 2023
Description
Given a DNA string pattern and an integer $d$, find the collection of strings that are within a $d$-neighborhood of the given pattern. A $d$-neighborhood is the set of all $k$-mers whose Hamming distance from the pattern is at most $d$.
Parameters
$n$: length of string
$d$: neighborhood distance threshold
$\sigma$: size of alphabet
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Iterative naive | 1940 | $O(f_{bin}(sigma-{1}, n, d)$) where f_{bin}(x, y, z) = sum_{i=0}^z C(y, i)*x^i | $O(n)$ | Exact | Deterministic | Time |