2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2016★ 2 cited
Gerbil: A Fast and Memory-Efficient -mer Counter with GPU-Support
Marius Erbert, Steffen Rechner, Matthias Müller-Hannemann
A basic task in bioinformatics is the counting of -mers in genome strings. The -mer counting problem is to build a histogram of all substrings of length in a given genome…
cs.DM2014
Broder's Chain Is Not Rapidly Mixing
Annabell Berger, Steffen Rechner
We prove that Broder's Markov chain for approximate sampling near-perfect and perfect matchings is not rapidly mixing for Hamiltonian, regular, threshold and planar bipartite graph…