Rita Hartel

String Partition for Building Long Burrows-Wheeler Transforms

2024 · arXiv (Cornell University)

Constructing the Burrows-Wheeler transform (BWT) for long strings poses significant challenges regarding construction time and memory usage. We use a prefix of the suffix array to partition a long string into shorter substrings, thereby enabling …