Scaled and permuted string matching

Authors:
Ayelet Butman;Revital Eres;Gad M. Landau
Affiliations:
Holon Academic Institute of Technology, Israel;Department of Computer Science, Haifa University, Haifa 31905, Israel;Department of Computer Science, Haifa University, Haifa 31905, Israel and Department of Computer and Information Science, Polytechnic University, Six MetroTech Center, Brooklyn, NY 11201-3840, USA
Venue:
Information Processing Letters
Year:
2004

Citing 11
Cited 5

Matching patterns in strings subject to multi-linear transformations

Theoretical Computer Science
Efficient pattern matching with scaling

Journal of Algorithms
Text algorithms

Text algorithms
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Real scaled matching

Information Processing Letters
Algorithms for the Longest Common Subsequence Problem

Journal of the ACM (JACM)
A fast string searching algorithm

Communications of the ACM
Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations

CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
A Rotation Invariant Filter for Two-Dimensional String Matching

CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
Two-dimensional pattern matching with rotations

Theoretical Computer Science
Efficient randomized pattern-matching algorithms

IBM Journal of Research and Development - Mathematics and computing

On table arrangements, scrabble freaks, and jumbled pattern matching

FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Finding Patterns In Given Intervals

Fundamenta Informaticae
Near linear time construction of an approximate index for all maximum consecutive sub-sums of a sequence

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Finding patterns in given intervals

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
New algorithms for binary jumbled pattern matching

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

The goal of scaled permuted string matching is to find all occurrences of a pattern in a text, in all possible scales and permutations. Given a text of length n and a pattern of length m we present an O(n) algorithm.