Figure 1From: Linear-time computation of minimal absent words using suffix arrayk occurrences of a factor w of y ; they are preceded by a i and followed by b i . If there exist i,j∈[ 1:k] such that (a i ,b j )∉{(a1,b1),…,(a k ,b k )} then a i w b j is a minimal absent word of y.Back to article page