ArticlePloS one2017
A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations.
ThienLuan Ho et al.PubMed ↗Full text ↗Publisher ↗
No numbers read from the abstract.
2 papers cite it
this papercites it