4 citations · 5 across the 4 of their papers we have counts for
4 papers · 1 filter
On the Optimisation of the GSACA Suffix Array Construction Algorithm
Jannik Olbrich, Enno Ohlebusch, Thomas Büchler
The suffix array is arguably one of the most important data structures in sequence analysis and consequently there is a multitude of suffix sorting algorithms. However, to this dat…
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…
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…
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…