1 citations · 1 across the 4 of their papers we have counts for
4 papers · 1 filter
Compressing Hypergraphs using Suffix Sorting
Enno Adler, Stefan Böttcher, Rita Hartel
Hypergraphs model complex, non-binary relationships like co-authorships, social group memberships, and recommendations. Like traditional graphs, hypergraphs can grow large, posing…
IBB: Fast Burrows-Wheeler Transform Construction for Length-Diverse DNA Data
Enno Adler, Stefan Böttcher, Rita Hartel +1
The Burrows-Wheeler transform (BWT) is integral to the FM-index, which is used extensively in text compression, indexing, pattern search, and bioinformatic problems as de novo asse…
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…
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…