4 citations · 4 across the 1 of their papers we have counts for
3 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.DS2016
A representation of a compressed de Bruijn graph for pan-genome analysis that enables search
Timo Beller, Enno Ohlebusch
Recently, Marcus et al. (Bioinformatics 2014) proposed to use a compressed de Bruijn graph to describe the relationship between the genomes of many individuals/strains of the same…
cs.DS2010★ 4 cited
Lightweight LCP-Array Construction in Linear Time
Simon Gog, Enno Ohlebusch
The suffix tree is a very important data structure in string processing, but it suffers from a huge space consumption. In large-scale applications, compressed suffix trees (CSTs) a…