1. Linear-time computation of minimal absent words using suffix array;Barton;BMC Bioinform.,2014
2. Parallelising the computation of minimal absent words;Barton,2015
3. Computing forbidden words of regular languages;Béal;Fund. Inform.,2003
4. Forbidden words in symbolic dynamics;Béal;Adv. in Appl. Math.,2000
5. Versatile succinct representations of the bidirectional Burrows–Wheeler transform;Belazzougui,2013