 |
HAL UPEC - UPEM Portal |  |
 |
Book sections
A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches
Abstract : This paper deals with the approximate string-matching problem with Hamming distance. The approximate string-matching with kmismatches problem is to find all locations at which a query of length m matches a factor of a text of length n with k or fewer mismatches. The approximate string-matching algorithms have both pleasing theoretical features, as well as direct applications, especially in computational biology. We consider a generalisation of this problem, the fixed-length approximate string-matching with k-mismatches problem: given a text t, a pattern x and an integer l, search for all the occurrences in t of all factors of x of length l with k or fewer mismatches with a factor of t. We present a practical parallel algorithm of comparable simplicity that requires only O(nm(l/w)/p) time, where w is the word size of the machine (e.g. 32 or 64 in practice) and p the number of processors. Thus the algorithm's performance is independent of k and the alphabet size |Σ|. The proposed parallel algorithm makes use of message-passing parallelism model, and word-level parallelism for efficient approximate string-matching.
Cited literature [19 references]
https://hal-upec-upem.archives-ouvertes.fr/hal-00741966
Contributor : Maxime Crochemore <>
Submitted on : Wednesday, February 13, 2013 - 11:24:01 AM
Last modification on : Wednesday, February 3, 2021 - 7:54:26 AM
Long-term archiving on: : Tuesday, May 14, 2013 - 4:00:05 AM
Contributor : Maxime Crochemore <>
Submitted on : Wednesday, February 13, 2013 - 11:24:01 AM
Last modification on : Wednesday, February 3, 2021 - 7:54:26 AM
Long-term archiving on: : Tuesday, May 14, 2013 - 4:00:05 AM
File
A_Parallel_Algorithm_for_Fixed...
Files produced by the author(s)