2 papers
cs.DS2019
Edge minimization in de Bruijn graphs
Uwe Baier, Thomas Büchler, Enno Ohlebusch +1
This paper introduces the de Bruijn graph edge minimization problem, which is related to the compression of de Bruijn graphs: find the order-k de Bruijn graph with minimum edge cou…
cs.DS2018
On Undetected Redundancy in the Burrows-Wheeler Transform
Uwe Baier
The Burrows-Wheeler-Transform (BWT) is an invertible permutation of a text known to be highly compressible but also useful for sequence analysis, what makes the BWT highly attracti…