B. Haubold, N. Pierstorff, F. Möller, and T. Wiehe, Genome comparison without alignment using shortest unique substrings, BMC Bioinformatics, vol.6, issue.1, p.123, 2005.
DOI : 10.1186/1471-2105-6-123

M. Domazet-lo?o and B. Haubold, Efficient estimation of pairwise distances between genomes, Bioinformatics, vol.25, issue.24, pp.3221-3227, 2009.
DOI : 10.1093/bioinformatics/btp590

G. Hampikian, T. Andersen, R. Altman, A. Dunker, L. Hunter et al., ABSENT SEQUENCES: NULLOMERS AND PRIMES, Biocomputing 2007, pp.355-366
DOI : 10.1142/9789812772435_0034

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

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
DOI : 10.1016/j.ipl.2010.05.008

A. Pinho, P. Ferreira, and S. Garcia, On finding minimal absent words, BMC Bioinformatics, vol.10, issue.1, 200911.
DOI : 10.1186/1471-2105-10-137

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

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
URL : http://doi.org/10.1016/s0304-3975(00)00436-9

G. Fici, Minimal forbidden words and applications, 2006.
URL : https://hal.archives-ouvertes.fr/tel-00628628

C. Acquisti, G. Poste, D. Curtiss, and S. Kumar, Nullomers: really a matter of natural selection? PLoS ONE, p.1022, 2007.

S. Garcia, A. Pinho, J. Rodrigues, C. Bastos, and P. Ferreira, Minimal Absent Words in Prokaryotic and Eukaryotic Genomes, PLoS ONE, vol.18, issue.1, p.16065, 2011.
DOI : 10.1371/journal.pone.0016065.t003

S. Garcia and A. Pinho, Minimal Absent Words in Four Human Genome Assemblies, PLoS ONE, vol.37, issue.12, p.29344
DOI : 10.1371/journal.pone.0029344.t005

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

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

U. Manber and E. Myers, Suffix Arrays: A New Method for On-Line String Searches, SIAM Journal on Computing, vol.22, issue.5, pp.935-948, 1993.
DOI : 10.1137/0222058

G. Nong, S. Zhang, and W. Chan, Linear Suffix Array Construction by Almost Pure Induced-Sorting, 2009 Data Compression Conference, pp.193-202, 2009.
DOI : 10.1109/DCC.2009.42

J. Fischer, . Inducing, and . Lcp-array, Inducing the LCP-Array, Algorithms and Data Structures - 12th International Symposium, pp.374-385
DOI : 10.1007/978-3-642-22300-6_32