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.DS2025
An Efficient Data Structure and Algorithm for Long-Match Query in Run-Length Compressed BWT
Ahsan Sanaullah, Degui Zhi, Shaojie Zhang
In this paper, we describe a new type of match between a pattern and a text that aren't necessarily maximal in the query, but still contain useful matching information: locally max…