Cargando…
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)....
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Public Library of Science
2017
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5634649/ https://www.ncbi.nlm.nih.gov/pubmed/29016700 http://dx.doi.org/10.1371/journal.pone.0186251 |