Golnaz Badkobeh

Internal Shortest Absent Word Queries

2021 · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

Given a string T of length n over an alphabet Σ ⊂ {1,2,…,n^{𝒪(1)}} of size σ, we are to preprocess T so that given a range [i,j], we can return a representation of a shortest …