@inproceedings{3598ee6d12a0479a8cff74ba51031fd5,
title = "Permuted scaled matching",
abstract = "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.",
author = "Ayelet Butman and Noa Lewenstein and Munro, {J. Ian}",
year = "2014",
doi = "10.1007/978-3-319-07566-2_8",
language = "אנגלית",
isbn = "9783319075655",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "70--78",
booktitle = "Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Proceedings",
address = "גרמניה",
note = "25th Annual Symposium on Combinatorial Pattern Matching, CPM 2014 ; Conference date: 16-06-2014 Through 18-06-2014",
}