A carregar...
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)....
Na minha lista:
| Publicado no: | PLoS One |
|---|---|
| Main Authors: | , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Public Library of Science
2017
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5634649/ https://ncbi.nlm.nih.gov/pubmed/29016700 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1371/journal.pone.0186251 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|