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

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)....

Full description

Bibliographic Details
Main Authors: ThienLuan Ho, Seung-Rohk Oh, HyunJin Kim
Format: Article
Language:English
Published: Public Library of Science (PLoS) 2017-01-01
Series:PLoS ONE
Online Access:http://europepmc.org/articles/PMC5634649?pdf=render

Similar Items

Similar Items