Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings

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.