Strdiff is a library for calculating string differences. It leverages efficient algorithms such as the Levenshtein distance and will soon include the Demerau-Levenshtein distance.
Library for computing Levenshtein and Demerau-Levenshtein distances of strings and list of strings
Find motifs using Gibbs Sampler, Median String, and Randomized Motif Search algorithms in a fasta formatted file of reads
Refer to the README to understand the input data
Find motifs using Gibbs Sampler, Median String, and Randomized Motif Search algorithms in a fasta formatted file of reads
Refer to the README to understand the input data