Parallel pattern matching with swaps on a linear array

Authors:
Fouad B. Chedid
Affiliations:
Department of Computer Science, Notre Dame University - Louaize, Zouk Mikael, Zouk Mosbeh, Lebanon
Venue:
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Year:
2010

Citing 12
Cited 0

Improved string matching with k mismatches

ACM SIGACT News
Efficient string matching with k mismatches

Theoretical Computer Science
Generalized string matching

SIAM Journal on Computing
A new approach to text searching

Communications of the ACM
Fast algorithms for approximately counting mismatches

Information Processing Letters
Faster algorithms for string matching with k mismatches

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Pattern matching with swaps

Journal of Algorithms
Approximate swapped matching

Information Processing Letters
Overlap matching

Information and Computation
Pattern matching with swaps

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Pattern Matching with Swaps for Short Patterns in Linear Time

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
A new model to solve the swap matching problem and efficient algorithms for short patterns

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Pattern Matching with Swaps problem is a variation of the classical pattern matching problem in which a match is allowed to include disjoint local swaps In 2009, Cantone and Faro devised a new dynamic programming algorithm for this problem that runs in time O(nm), where n is the length of the text and m is the length of the pattern In this paper, first, we present an improved dynamic programming formulation of the approach of Cantone and Faro Then, we present an optimal parallelization of our algorithm, based on a linear array model, that runs in time O(m2) using $\lceil \frac n {m-1}\rceil$ processors.