Scaled and permuted string matching

@article{Butman2004ScaledAP,
  title={Scaled and permuted string matching},
  author={Ayelet Butman and Revital Eres and Gad M. Landau},
  journal={Inf. Process. Lett.},
  year={2004},
  volume={92},
  pages={293-297}
}
The goal ofscaled permuted string matching is to find all occurrences of a pattern in a text, in all possible scales permutations. Given a text of length n and a pattern of length m we present an O (n) algorithm.  2004 Elsevier B.V. All rights reserved. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Two-dimensional Pattern Matching

M G W H Van De Rijdt
2005

M

A. Amir, A. Butman
Crocehmore, G.M. Landau M. Schaps, Two-dimensional pattern matching with rotatio Theoret. Comput. Sci. 314 (1–2) • 2004
View 1 Excerpt

Ukkonen , A rotation invariant filter for two - dimensional string matching , in : Proc . 9 th Annual Sy posium on Combinatorial Pattern Matching ( CPM

E. K. Fredriksson
Lecture Notes in Comput . Sci . • 1998

Efficient randomized patternmatch algorithms

M. O. Rabin R. Karp
IBM J . Res . Dev . • 1997

Z

A. Apostolico
Galil (Eds.), Pattern Matching Algorithm Oxford University Press • 1997

Similar Papers

Loading similar papers…