1

Lossless Indexing with Counting de Bruijn Graphs
We propose the concept of Counting de Bruijn graphs generalizing the notion of annotated (or colored) de Bruijn graphs. Counting de Bruijn graphs supplement each node-label relation with one or many attributes (e.g., a k-mer count or its positions in genome).
Topology-based Sparsification of Graph Annotations
We present RowDiff, a new technique for compacting graph annotations by leveraging expected similarities in labelings of adjacent nodes.
Sparse Binary Relation Representations for Genome Graph Annotation
We present Multi-BRWT, a scheme for compressed representation of sparse binary bitrices adaptive to different kinds of input data.