
Compact Euler Tours of Trees with Small Maximum Degree
We show how an Euler tour for a tree on n vertices with maximum degree d...
read it

A Fast and Small Subsampled Rindex
The rindex (Gagie et al., JACM 2020) represented a breakthrough in comp...
read it

rindexing Wheeler graphs
Let G be a Wheeler graph and r be the number of runs in a BurrowsWheele...
read it

PHONI: Streamed Matching Statistics with MultiGenome References
Computing the matching statistics of patterns with respect to a text is ...
read it

PFP Data Structures
Prefixfree parsing (PFP) was introduced by Boucher et al. (2019) as a p...
read it

Faster Dynamic Compressed dary Relations
The k^2tree is a successful compact representation of binary relations ...
read it

TreeShape Grammars for Random Access
Shape grammars are well known in the graphics and design communities but...
read it

Matching reads to many genomes with the rindex
The rindex is a tool for compressed indexing of genomic databases for e...
read it

Rpair: Rescaling RePair with Rsync
Data compression is a powerful tool for managing massive but repetitive ...
read it

Simulating the DNA String Graph in Succinct Space
Converting a set of sequencing reads into a lossless compact data struct...
read it

Efficient Construction of a Complete Index for PanGenomics Read Alignment
While short read aligners, which predominantly use the FMindex, are abl...
read it

Tunneling on Wheeler Graphs
The BurrowsWheeler Transform (BWT) is an important technique both in da...
read it

Relative compression of trajectories
We present RCT, a new compact data structure to represent trajectories o...
read it

The ReadOptimized BurrowsWheeler Transform
The advent of highthroughput sequencing has resulted in massive genomic...
read it

FullyFunctional Suffix Trees and Optimal Text Searching in BWTruns Bounded Space
Indexing highly repetitive texts  such as genomic databases, software...
read it

Tree Path Majority Data Structures
We present the first solution to τmajorities on tree paths. Given a tre...
read it

Assembling Omnitigs using HiddenOrder de Bruijn Graphs
De novo DNA assembly is a fundamental task in Bioinformatics, and findin...
read it

PrefixFree Parsing for Building Big BWTs
Highthroughput sequencing technologies have led to explosive growth of ...
read it

TwoDimensional Block Trees
The Block Tree (BT) is a novel compact data structure designed to compre...
read it

Fast LempelZiv Decompression in Linear Space
We consider the problem of decompressing the LempelZiv 77 representatio...
read it

Online LZ77 Parsing and Matching Statistics with RLBWTs
LempelZiv 1977 (LZ77) parsing, matching statistics and the BurrowsWhee...
read it

A Separation Between RunLength SLPs and LZ77
In this paper we give an infinite family of strings for which the length...
read it
Travis Gagie
is this you? claim profile