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.
Original language | English |
---|---|
Pages (from-to) | 293-297 |
Number of pages | 5 |
Journal | Information Processing Letters |
Volume | 92 |
Issue number | 6 |
DOIs | |
State | Published - 31 Dec 2004 |
Bibliographical note
Funding Information:* Corresponding author. E-mail addresses: [email protected] (A. Butman), [email protected] (R. Eres), [email protected] (G.M. Landau). 1Partially supported by the Israel Science Foundation grant 282/01. 2 Partially supported by NSF grant CCR-0104307, by the Israel Science Foundation grant 282/01, and by IBM Faculty Award.
Keywords
- Algorithms
- Approximate string matching
- Permutations
- Scalings
ASJC Scopus subject areas
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications