Today’s must read paper appeared in arxiv (emphasis ours).
De Brujin graphs are widely used in bioinformatics for processing next- generation sequencing data. Due to a very large size of NGS datasets, it is essential to represent de Bruijn graphs compactly, and several approaches to this problem have been proposed recently. In this work, we show how to reduce the memory required by the algorithm of  that represents de Brujin graphs using Bloom filters. Our method requires 30% to 40% less memory with respect to the method of , with insignificant impact to construction time. At the same time, our experiments showed a better query time compared to . This is, to our knowledge, the best practical representation for de Bruijn graphs.
Those unfamiliar with Minia can read our earlier commentaries.
P.S. Adding a twitter conversation in case the same question comes to your mind, because five months later people will be chatting about different things in twitter.