|
|||||
|
|
Scaled and permuted string matching |
|
| Authors: | Ayelet Butman Gad M. Landau |
| Affiliation: | a Holon Academic Institute of Technology, Israel b Department of Computer Science, Haifa University, Haifa 31905, Israel c Department of Computer and Information Science, Polytechnic University, Six MetroTech Center, Brooklyn, NY 11201-3840, USA |
| 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. |
| Keywords: | Algorithms Approximate string matching Permutations Scalings |
| 本文献已被 ScienceDirect 等数据库收录！ | |