A. Abboud, V. V. Williams, and O. Weimann, Consequences of Faster Alignment of Sequences, 41st ICALP, Part I. pp. 39?51, 2014.
DOI : 10.1007/978-3-662-43948-7_4

C. Acquisti, G. Poste, D. Curtiss, and S. Kumar, Nullomers: Really a Matter of Natural Selection?, PLoS ONE, vol.13, issue.10, 2007.
DOI : 10.1371/journal.pone.0001022.t001

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, p.388, 2014.
DOI : 10.1186/s12859-014-0388-9
URL : https://hal.archives-ouvertes.fr/hal-01110274

D. Belazzougui, F. Cunial, J. Kärkkäinen, and V. Mäkinen, Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform, LNCS, pp.21-133, 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, issue.0, pp.109-116, 2012.
DOI : 10.1016/j.tcs.2012.04.031
URL : https://hal.archives-ouvertes.fr/hal-00742560

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

J. Fischer, Inducing the LCP-Array, 12th WADS, pp.374-385, 2011.
DOI : 10.1007/978-3-642-22300-6_32

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

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

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

G. Jacobson, Space-efficient static trees and graphs, 30th Annual Symposium on Foundations of Computer Science, pp.30-549, 1989.
DOI : 10.1109/SFCS.1989.63533

U. Manber and E. W. 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

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. Nong, S. Zhang, and W. H. Chan, Linear Suffix Array Construction by Almost Pure Induced-Sorting, 2009 Data Compression Conference, pp.193-202, 2009.
DOI : 10.1109/DCC.2009.42

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

J. Shun, Fast Parallel Computation of Longest Common Prefixes, SC14: International Conference for High Performance Computing, Networking, Storage and Analysis, pp.387-398, 2014.
DOI : 10.1109/SC.2014.37

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, 2015.
DOI : 10.1093/bioinformatics/btv189

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