Parallel Algorithm for Approximate String Matching with K Differences
Published • Jul 1, 2013
NobleIDNI3P38W10R51S94
Authors:,,
Longjiang Guo
Shufang Du
Meirui Ren
Abstract
Approximate string matching using the k-difference technique has been widely applied to many fields such as pattern recognition and computational biology. Data dependency exists in the traditional sequential algorithm. Therefore, it is hard to design a parallel algorithm for approximate string match...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!