Computing k-mers in Graphs

Jarno N. Alanko, Maximo Perez-Lopez

We initiate the study of computational problems on $k$-mers (strings of length $k$) in labeled graphs. As a starting point, we consider the problem of counting the number of distin…