Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Computing k-mers in Graphs
Jarno N. Alanko, Maximo Perez-Lopez
We initiate the study of computational problems on -mers (strings of length ) in labeled graphs. As a starting point, we consider the problem of counting the number of distin…
cs.DS2024
Dynamic Range Minimum Queries on the Ultra-Wide Word RAM
Philip Bille, Inge Li Gørtz, Tord Stordalen +1
We consider the dynamic range minimum problem on the ultra-wide word RAM model of computation. This model extends the classic -bit word RAM model with special ultrawords of leng…