Meta-colored compacted de Bruijn graphs: overview and challenges.

This note introduces the meta-colored compacted de Bruijn graph (Mac-dBG) - a colored de Bruijn graph data structure where colors are represented holistically, i.e., taking into account their redundancy across the whole set of colors, rather than individually as atomic integer lists. Preliminary results show that Mac-dBGs achieve remarkably better compression effectiveness of the color information compared to the state of the art, without sacrificing query time. We discuss a simple framework to build Mac-dBGs and conclude with a list of potentially fruitful research directions that we are currently pursuing.