29 citations · 45 across the 41 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.DS2021
String Sampling with Bidirectional String Anchors
Grigorios Loukides, Solon P. Pissis, Michelle Sweering
The minimizers sampling mechanism is a popular mechanism for string sampling introduced independently by Schleimer et al. [SIGMOD 2003] and by Roberts et al. [Bioinf. 2004]. Given…
cs.DS2021
Internal Shortest Absent Word Queries in Constant Time and Linear Space
Golnaz Badkobeh, Panagiotis Charalampopoulos, Dmitry Kosolobov +1
Given a string of length over an alphabet of size , we are to preprocess so that given a range , we can return a representa…
cs.DS2021
Faster Algorithms for Longest Common Substring
Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski +1
In the classic longest common substring (LCS) problem, we are given two strings and , each of length at most , over an alphabet of size , and we are asked to find a lo…