Bounding the Average Move Structure Query for Faster and Smaller RLBWT Permutations

Nathaniel K. Brown, Ben Langmead

The move structure represents permutations with long contiguously permuted intervals in compressed space with optimal query time. They have become an important feature of compresse…