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

Nathaniel K. Brown, Ben Langmead. Bounding the Average Move Structure Query for Faster and Smaller RLBWT Permutations. In Martin Aumüller 0001, Irene Finocchi, editors, 24th International Symposium on Experimental Algorithms, SEA 2026, Copenhagen, Denmark, June 22-24, 2026. Volume 371 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. [doi]

Abstract

Abstract is missing.