Fast parallel and serial approximate string matching
Journal of Algorithms
An improved algorithm for approximate string matching
SIAM Journal on Computing
Small-bias probability spaces: efficient constructions and applications
SIAM Journal on Computing
A theory of parameterized pattern matching: algorithms and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Alphabet dependence in parameterized matching
Information Processing Letters
Text algorithms
Efficient 2-dimensional approximate matching of half-rectangular figures
Information and Computation
String matching under a general matching relation
Information and Computation
Pattern matching algorithms
SIAM Journal on Computing
Efficient special cases of Pattern Matching with Swaps
Information Processing Letters
Approximate string matching: a simpler faster algorithm
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
An Extension of the String-to-String Correction Problem
Journal of the ACM (JACM)
Faster algorithms for string matching with k mismatches
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
On the complexity of the Extended String-to-String Correction Problem
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Randomized Swap Matching in $O(m \log m \log |\Sigma| )$ time
Randomized Swap Matching in $O(m \'log m \'log |\'Sigma| )$ time
Information Processing Letters
The Problem of Context Sensitive String Matching
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Journal of Discrete Algorithms
Average-optimal string matching
Journal of Discrete Algorithms
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.00 |
We propose a new paradigm for string matching, namely structural matching. In structural matching, the text and pattern contents are not important. Rather, some areas in the text and patterns are singled out, say intervals. A “match” is a text location where a specified relation between the text and pattern areas is satisfied.In particular we define the structural matching problem of Overlap (Parity) Matching. We seek the text locations where all overlaps of the given pattern and text intervals have even length. We show that this problem can be solved in time &Ogr;(n log m), where the text length is n and the pattern length is m.As an application of overlap matching, we show how to reduce the String Matching with Swaps problem to the overlap matching problem. The String Matching with Swaps problem is the problem of string matching in the presence of local swaps. The best known deterministic upper bound for this problem was &Ogr;(nm1/3 log m log &sgr;) for a general alphabet ∑, where &sgr; = min(m, ¦∑¦).Our reduction provides a solution to the pattern matching with swaps problem in time &Ogr;(n log m log &sgr;).