Combinatorics of minimal absent words for a sliding window

Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets

“…Recently, Akagi et al [35] proposed a space-efficient representation of all MAWs for the input string y which is based on the run length encoding (RLE ). Their data structure takes O(m) space and can output all MAWs in O(|MAW(y)|) time, where m is the RLE size of y.…”