![](/img/cover-not-exists.png)
A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations
Ho, ThienLuan, Oh, Seung-Rohk, Kim, HyunJin, Zou, QuanVolume:
12
Language:
english
Journal:
PLOS ONE
DOI:
10.1371/journal.pone.0186251
Date:
October, 2017
File:
PDF, 12.17 MB
english, 2017