A. V. Aho and M. J. Corasick, Efficient string matching: an aid to bibliographic search, Communications of the ACM, vol.18, issue.6, pp.333-340, 1975.
DOI : 10.1145/360825.360855

Y. Almirantis, P. Charalampopoulos, J. Gao, C. S. Iliopoulos, M. Mohamed et al., On avoided words, absent words, and their application to biological sequence analysis, Algorithms for Molecular Biology, vol.335, issue.3, pp.1-5, 2017.
DOI : 10.1016/j.jmb.2003.10.075

C. Barton, A. Heliou, L. Mouchard, and S. P. Pissis, Linear-time computation of minimal absent words using suffix array, BMC Bioinformatics, vol.22, issue.5, 2014.
DOI : 10.1109/DCC.2009.42
URL : https://hal.archives-ouvertes.fr/hal-01110274

C. Barton, A. Heliou, L. Mouchard, and S. P. Pissis, Parallelising the Computation of Minimal Absent Words, PPAM, Part II, pp.243-253, 2015.
DOI : 10.1007/978-3-319-32152-3_23
URL : https://hal.archives-ouvertes.fr/hal-01255489

M. Béal, F. Mignosi, and A. Restivo, Minimal forbidden words and symbolic dynamics, STACS, pp.555-566, 1996.
DOI : 10.1007/3-540-60922-9_45

D. Belazzougui, F. Cunial, J. Kärkkäinen, and V. Mäkinen, Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform, ESA, pp.133-144, 2013.
DOI : 10.1007/978-3-642-40450-4_12

S. Chairungsee and M. Crochemore, Using minimal absent words to build phylogeny, Theoretical Computer Science, vol.450, pp.109-116, 2012.
DOI : 10.1016/j.tcs.2012.04.031
URL : https://hal.archives-ouvertes.fr/hal-00742560

M. Crochemore, G. Fici, R. Mercas, and S. P. Pissis, Linear-Time Sequence Comparison Using Minimal Absent Words & Applications, LATIN, pp.334-346, 2016.
DOI : 10.1007/978-3-662-49529-2_25

M. Crochemore, C. Hancart, and T. Lecroq, Algorithms on Strings, 2007.
DOI : 10.1017/CBO9780511546853
URL : https://hal.archives-ouvertes.fr/hal-00470109

M. Crochemore, F. Mignosi, and A. Restivo, Automata and forbidden words, Information Processing Letters, vol.67, issue.3, pp.111-117, 1998.
DOI : 10.1016/S0020-0190(98)00104-5
URL : https://hal.archives-ouvertes.fr/hal-00619578

M. Crochemore, F. Mignosi, A. Restivo, and S. Salemi, Data compression using antidictionaries, Proceedings of the IEEE, vol.88, issue.11, pp.1756-1768, 2000.
DOI : 10.1109/5.892711
URL : https://hal.archives-ouvertes.fr/hal-00619579

B. Dömölki, An algorithm for syntactical analysis, Computational Linguistics, vol.3, pp.29-46, 1964.

P. Ferragina and G. Manzini, Opportunistic data structures with applications, Proceedings 41st Annual Symposium on Foundations of Computer Science, pp.390-398, 2000.
DOI : 10.1109/SFCS.2000.892127

G. Fici, Minimal Forbidden Words and Applications, Thèse, 2006.
URL : https://hal.archives-ouvertes.fr/tel-00628628

Y. Fujishige, Y. Tsujimaru, S. Inenaga, H. Bannai, and M. Takeda, Computing dawgs and minimal absent words in linear time for integer alphabets, MFCS Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.1-38, 2016.

D. Gusfield, Algorithms on strings, trees and sequences: computer science and computational biology, 1997.
DOI : 10.1017/CBO9780511574931

G. Hampikian and T. L. Andersen, ABSENT SEQUENCES: NULLOMERS AND PRIMES, Biocomputing 2007, pp.355-366, 2007.
DOI : 10.1142/9789812772435_0034

A. Heliou, S. P. Pissis, and S. J. Puglisi, emMAW: computing minimal absent words in external memory, Bioinformatics, vol.33, issue.17, 2017.
DOI : 10.1093/bioinformatics/btx209
URL : https://hal.archives-ouvertes.fr/hal-01569271

J. Herold, S. Kurtz, and R. Giegerich, Efficient computation of absent words in genomic sequences, BMC Bioinformatics, vol.9, issue.1, 2008.
DOI : 10.1186/1471-2105-9-167

G. Kucherov, K. Salikhov, and D. Tsur, Approximate string matching using a bidirectional index, Theoretical Computer Science, vol.638, pp.145-158, 2016.
DOI : 10.1016/j.tcs.2015.10.043
URL : https://hal.archives-ouvertes.fr/hal-00824706

G. M. Landau, E. W. Myers, and J. P. Schmidt, Incremental String Comparison, SIAM Journal on Computing, vol.27, issue.2, pp.27-2557, 1998.
DOI : 10.1137/S0097539794264810

F. Mignosi, A. Restivo, and M. Sciortino, Words and forbidden factors, Theoretical Computer Science, vol.273, issue.1-2, pp.99-117, 2002.
DOI : 10.1016/S0304-3975(00)00436-9

G. Myers, A fast bit-vector algorithm for approximate string matching based on dynamic programming, Journal of the ACM, vol.46, issue.3, pp.395-415, 1999.
DOI : 10.1145/316542.316550

G. Navarro, A guided tour to approximate string matching, ACM Computing Surveys, vol.33, issue.1, pp.31-88, 2001.
DOI : 10.1145/375360.375365

G. Navarro, R. A. Baeza-yates, E. Sutinen, and J. Tarhio, A New Indexing Method for Approximate String Matching, IEEE Data Engineering Bulletin, vol.15, issue.1, pp.19-27, 2001.
DOI : 10.1007/BF01942606

G. Navarro and M. Raffinot, Flexible Pattern Matching in Strings : Practical Online Search Algorithms for Texts and Biological Sequences, 2008.
DOI : 10.1017/CBO9781316135228

T. Ota, H. Fukae, and H. Morita, Dynamic construction of an antidictionary with linear complexity, Theoretical Computer Science, vol.526, pp.108-119, 2014.
DOI : 10.1016/j.tcs.2014.01.021

T. Ota and H. Morita, On a universal antidictionary coding for stationary ergodic sources with finite alphabet, ISITA, pp.294-298, 2014.

M. S. Rahman, A. Alatabbi, T. Athar, M. Crochemore, and M. S. Rahman, Absent words and the (dis)similarity analysis of DNA sequences: an experimental study, BMC Research Notes, vol.4, issue.4, pp.1-8, 2016.
DOI : 10.1093/bioinformatics/btv189

M. Senft, Suffix tree for a sliding window: An overview, WDS, pp.41-46, 2005.

R. M. Silva, D. Pratas, L. Castro, A. J. Pinho, and P. J. Ferreira, Three minimal sequences found in Ebola virus genomes and absent from human DNA: Fig. 1., Bioinformatics, vol.31, issue.15, pp.312421-2425, 2015.
DOI : 10.1093/bioinformatics/btv189

E. Ukkonen, On-line construction of suffix trees, Algorithmica, vol.10, issue.3, pp.249-260, 1995.
DOI : 10.1145/321941.321946

Z. Wu, T. Jiang, and W. Su, Efficient computation of shortest absent words in a genomic sequence, Information Processing Letters, vol.110, issue.14-15, pp.14-15596, 2010.
DOI : 10.1016/j.ipl.2010.05.008