3 papers
cs.DS2025★ 1 cited
When is String Reconstruction using de Bruijn Graphs Hard?
Ben Bals, Sebastiaan van Krieken, Solon P. Pissis +2
The reduction of the fragment assembly problem to (variations of) the classical Eulerian trail problem [Pevzner et al., PNAS 2001] has led to remarkable progress in genome assembly…
cs.DS2025
String Consensus Problems with Swaps and Substitutions
Estéban Gabory, Laurent Bulteau, Gabriele Fici +1
String consensus problems aim at finding a string that minimizes some given distance with respect to an input set of strings. In particular, in the Closest string problem, we are g…
cs.DS2024
Minimizing the Minimizers via Alphabet Reordering
Hilde Verbeek, Lorraine A. K. Ayad, Grigorios Loukides +1
Minimizers sampling is one of the most widely-used mechanisms for sampling strings [Roberts et al., Bioinformatics 2004]. Let be a string over a totally ordered…