Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4952348 | Theoretical Computer Science | 2016 | 25 Pages |
Abstract
A Jumbled Square is a string of the form xx¯, where x¯ is a permutation of x. The Jumbled Square problem is the problem of finding for every location j in S, the longest jumbled square that ends in j, if such exists. We provide an algorithm that solves this problem in O(|Σ|(r2+n)) time, and O(|Σ|n) space.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg,