N. G. De-bruijn, On bases for the set of integers, Publ. Math. (Debr.), vol.1, pp.232-242, 1950.

P. Pevzner, H. Tang, and M. Waterman, An Eulerian path approach to DNA fragment assembly, Proc. Natl. Acad. Sci. USA 98, pp.9748-9753, 2001.
DOI : 10.1126/science.1058040
URL : http://www.pnas.org/content/98/17/9748.full.pdf

G. Rizk, A. Gouin, R. Chikhi, and C. Lemaitre, MindTheGap: integrated detection and assembly of short and long insertions, Bioinformatics, vol.30, issue.24, pp.3451-3457, 2014.
DOI : 10.1093/bioinformatics/btu545
URL : https://hal.archives-ouvertes.fr/hal-01087832

L. Salmela and E. Rivals, LoRDEC: accurate and efficient long read error correction, Bioinformatics, vol.30, issue.24, pp.3506-3514, 2014.
DOI : 10.1093/bioinformatics/btu538
URL : https://hal.archives-ouvertes.fr/lirmm-01100451

T. C. Conway and A. J. Bromage, Succinct data structures for assembling large genomes, Bioinformatics, vol.27, issue.4, pp.479-486, 2011.
DOI : 10.1093/bioinformatics/btq697
URL : https://academic.oup.com/bioinformatics/article-pdf/27/4/479/16903192/btq697.pdf

A. Bowe, T. Onodera, K. Sadakane, and T. Shibuya, Succinct de Bruijn Graphs, Lect. Notes Comput. Sci, vol.7534, pp.225-235, 2012.
DOI : 10.1007/978-3-642-33122-0_18

R. Chikhi and G. Rizk, Space-efficient and exact de Bruijn graph representation based on a Bloom filter, Algorithms Mol. Biol, vol.8, issue.22, 2013.
DOI : 10.1007/978-3-642-33122-0_19
URL : https://hal.archives-ouvertes.fr/hal-00868805

Y. Peng, H. Leung, S. Yiu, and F. Chin, IDBA ??? A Practical Iterative de Bruijn Graph De Novo Assembler, Research in Computational Molecular Biology, pp.426-440, 2010.
DOI : 10.1007/978-3-642-12683-3_28
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.195

R. Chikhi and G. Rizk, Space-Efficient and Exact de Bruijn Graph Representation Based on a Bloom Filter, Lect. Notes Comput. Sci, vol.7534, pp.236-248, 2012.
DOI : 10.1007/978-3-642-33122-0_19
URL : https://hal.archives-ouvertes.fr/hal-00868805

L. Salmela, Correction of sequencing errors in a mixed set of reads, Bioinformatics, vol.26, issue.10, pp.1284-1290, 2010.
DOI : 10.1093/bioinformatics/btq151

T. Onodera, K. Sadakane, and T. Shibuya, Detecting Superbubbles in Assembly Graphs, Algorithms in Bioinformatics Lect. Notes Comput. Sci, vol.8126, pp.338-348, 2013.
DOI : 10.1007/978-3-642-40453-5_26
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.744.5621

J. T. Simpson and R. Durbin, Efficient construction of an assembly string graph using the FM-index, Bioinformatics, vol.26, issue.12, pp.367-373, 2010.
DOI : 10.1093/bioinformatics/btq217

E. Mccreight, A Space-Economical Suffix Tree Construction Algorithm, Journal of the ACM, vol.23, issue.2, pp.262-272, 1976.
DOI : 10.1145/321941.321946

A. Apostolico, The myriad virtues of suffix trees, Combinatorial Algorithms on Words, pp.85-96, 1985.

U. Manber and G. 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
URL : http://webglimpse.net/pubs/suffix.pdf

J. C. Na, A. Apostolico, C. S. Iliopoulos, and K. Park, Truncated suffix trees and their application to data compression, Theoretical Computer Science, vol.304, issue.1-3, pp.1-3, 2003.
DOI : 10.1016/S0304-3975(03)00053-7
URL : https://doi.org/10.1016/s0304-3975(03)00053-7

M. H. Schulz, S. Bauer, and P. N. Robinson, The generalised k-Truncated Suffix Tree for time-and space-efficient searches in multiple DNA or protein sequences, International Journal of Bioinformatics Research and Applications, vol.4, issue.1, pp.81-95, 2008.
DOI : 10.1504/IJBRA.2008.017165

B. Cazaux, T. Lecroq, and E. Rivals, From Indexing Data Structures to de Bruijn Graphs, Proc. of the 25th Annual Symposium on Combinatorial Pattern Matching (CPM), pp.89-99, 2014.
DOI : 10.1007/978-3-319-07566-2_10
URL : https://hal.archives-ouvertes.fr/lirmm-01081429

B. Cazaux, T. Lecroq, and E. Rivals, Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree, Proc. of the 9th Int. Conf. on Language and Automata Theory and Applications (LATA), pp.109-120, 2015.
DOI : 10.1007/978-3-319-15579-1_8

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

E. Ohlebusch, Bioinformatics Algorithms: Sequence Analysis, Genome Rearrangements, and Phylogenetic Reconstruction, p.604, 2013.

A. Bankevich, S. Nurk, D. Antipov, A. A. Gurevich, M. Dvorkin et al., SPAdes: A New Genome Assembly Algorithm and Its Applications to Single-Cell Sequencing, Journal of Computational Biology, vol.19, issue.5, pp.455-477, 2012.
DOI : 10.1089/cmb.2012.0021
URL : https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3342519/pdf

C. Boucher, A. Bowe, T. Gagie, S. J. Puglisi, and K. Sadakane, Variable-Order de Bruijn Graphs, 2015 Data Compression Conference, pp.2015-383, 2015.
DOI : 10.1109/DCC.2015.70
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.763.3825