A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations


Approximate string matching with k-differences has a number of practical applications, ranging from pattern recognition to computational biology. This paper proposes an efficient memory-access algorithm for parallel approximate string matching with k-differences on Graphics Processing Units (GPUs). In the proposed algorithm, all threads in the same GPUs… (More)
DOI: 10.1371/journal.pone.0186251


8 Figures and Tables