Permuted scaled matching

Ayelet Butman, Noa Lewenstein, J. Ian Munro

Research output: Contribution to journalArticlepeer-review


Scaled matching and permutation matching are two well known paradigms in the domain of pattern matching. Scaled matching refers to finding an occurrence of a pattern which is enlarged proportionally by some scale k within a larger text. Permutation matching is the problem of finding all substrings within a text where the character statistics of the substring and the pattern are the same. Permutation matching is easy, while scaled matching requires innovative solutions. One interesting setting of applications is the merge of the two. The problem of scaled permuted matching (i.e. first permuting and then scaling) has been addressed and solved optimally. However, it was left as an open problem whether there are efficient algorithms for permuted scaled matching. In this paper we solve the problem efficiently in a deterministic setting and optimally in a randomized setting.

Original languageEnglish
Pages (from-to)27-32
Number of pages6
JournalTheoretical Computer Science
StatePublished - 25 Jul 2016
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2016 Elsevier B.V.


  • Jumbled matching
  • Pattern matching
  • Scaled matching


Dive into the research topics of 'Permuted scaled matching'. Together they form a unique fingerprint.

Cite this