2 papers
cs.DS2026
Optimal-Time Move Structure Construction
Nathaniel K. Brown, Ahsan Sanaullah, Shaojie Zhang +1
The move structure represents a permutation of by partitioning the domain into disjoint, contiguously permuted intervals, with being the minimum number of s…
cs.DS2026
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…