Description Usage Arguments Value
This build a matrix of distances between all kmers and unique kmers, considering reverse complements and matches to degenerate nucleotide alphabet.
| 1 2 3 4 |   build.wildcard.dictionary(kmer.len, mismatches, out.dir,
    alphabet = c("A", "C", "G", "T", "N", "S", "M", "R", "Y", "K", "W"),
    consecutive.mismatches = TRUE, no.cores = 1,
    verbose = TRUE)
 | 
| kmer.len | Length of kmers | 
| mismatches | Number of mismatches | 
| out.dir | Directory to write the diciontary in | 
| alphabet | Nucleotide alphabet. By defualt using all
single/double nucleotide combinations and N Note that the
first four alphabets have to be  | 
| consecutive.mismatches | Logical indicating whether only consecutive mismatches should be allowed | 
| no.cores | Number of cores of parallel processing | 
| verbose | Logical to show logs | 
Creates a file containing the following elements:
pairwise.kmers Distance matrix and
kmer.mapping Mapping of reverse complements and
kmers to features The filename is constructed based on
kmer length and kernel used and has the structure:
positional_wildcard_dict_kmer<kmer.len_mismatchesmismatches_alphalength
  (alphabet).Rdata
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.