407 citations
- Eindhoven University of TechnologyNL67 papers
- University of AmsterdamNL67 papers
- Vrije Universiteit AmsterdamNL22 papers
- Leiden UniversityNL19 papers
- Delft University of TechnologyNL18 papers
- Centre National de la Recherche ScientifiqueFR15 papers
- College of Western IdahoUS15 papers
- Radboud University NijmegenNL15 papers
- University of WaterlooCA11 papers
- Utrecht UniversityNL9 papers
- University of GroningenNL8 papers
- University of OxfordGB8 papers
Showing 2025 · cs.DSShow all
2 papers · 2 filters
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
Testing Quasiperiodicity
Christine Awofeso, Ben Bals, Oded Lachish +1
A cover (or quasiperiod) of a string is a shorter string such that every position of is contained in some occurrence of as a substring. The notion of covers was int…