1 citations · 1 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024
String Partition for Building Long Burrows-Wheeler Transforms
Enno Adler, Stefan Böttcher, Rita Hartel
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…
cs.DS2020★ 1 cited
Simulation computation in grammar-compressed graphs
Stefan Böttcher, Rita Hartel, Sven Peeters
Like [1], we present an algorithm to compute the simulation of a query pattern in a graph of labeled nodes and unlabeled edges. However, our algorithm works on a compressed graph g…