Efficient bit-parallel multi-patterns approximate string matching algorithms
Published in Scientific Research and Essays • Feb 18, 2011
NobleIDNI7P58W69R31S36
Authors:,,
Rajesh Prasad
Anuj Sharma
Alok Singh
Abstract
Multi-patterns approximate string matching (MASM) problem is to find all the occurrences of set of patterns P0, P1, P2...Pr-1, r≥1, in the given text T[0…n-1], allowing limited number of errors in the matches. This problem has many applications in computational biology viz. finding DNA subsequences ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!