Linear-time computation of generalized minimal absent words for multiple strings

Kouta Okabe, Takuya Mieno, Yuto Nakashima +2

A string $w$ is called a minimal absent word (MAW) for a string $S$ if $w$ does not occur as a substring in $S$ and all proper substrings of $w$ occur in $S$. MAWs are well-studied…