D-Neighborhood of a String: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

28 April 2023

10 April 2023

15 February 2023

  • curprev 10:2510:25, 15 February 2023‎ Admin talk contribs‎ 905 bytes +905‎ Created page with "{{DISPLAYTITLE:d-Neighborhood of a String (d-Neighborhood of a String)}} == 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 == <pre>n: length of string d: neighborhood distance threshold sigma: size of alphabet</pre> == Table of Algorithms == {| cla..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/D-Neighborhood_of_a_String"