Efficiently Finding All Minimal and Shortest Absent Subsequences in a String

Florin Manea, Tina Ringleb, Stefan Siemer +1

Given a string $w$, another string $v$ is said to be a subsequence of $w$ if $v$ can be obtained from $w$ by removing some of its letters; on the other hand, $v$ is called an absen…