The d-neighborhood of the k-mer Pattern is the collection of all k-mers that are at most Hamming distance d from Pattern
The d-neighborhood of the k-mer Pattern is the collection of all k-mers that are at most Hamming distance d from Pattern.
How many 4-mers are in the 3-neighborhood of Pattern = ACGT?
Note that the d-neighborhood of Pattern includes Pattern.
Comments
Post a Comment