1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.DS2022★ 1 cited
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…
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…