?. The and . Sa, = (g, h) such that i ? is not contained in lcp-intervals ?-[i, j] with ? ? k and h ? |s g |?k +1 (the associated string is s g [h

@. Subinit, S. Initexact, and S. , References [1] A. Apostolico. The myriad virtues of suffix trees, Combinatorial Algorithms on Words, pp.85-96, 1985.

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

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

R. Chikhi, A. Limasset, S. Jackman, J. Simpson, and P. Medvedev, On the representation of de Bruijn graphs. ArXiv e-prints, 2001.

R. Chikhi and G. Rizk, Space-efficient and exact de Bruijn graph representation based on a Bloom filter, Algorithms for Molecular Biology, vol.8, issue.1, p.22, 2013.
DOI : 10.1101/gr.131383.111
URL : https://hal.archives-ouvertes.fr/hal-00753930

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

N. De-bruijn, On bases for the set of integers, Publ. Math. Debrecen, vol.1, issue.3, pp.232-242, 1950.

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

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

E. Ohlebusch, Bioinformatics Algorithms: Sequence Analysis, Genome Rearrangements, and Phylogenetic Reconstruction, pp.10-11, 2013.

T. Onodera, K. Sadakane, and T. Shibuya, Detecting Superbubbles in Assembly Graphs, Algorithms in Bioinformatics LNCS, vol.8126, issue.2, pp.338-348, 2013.
DOI : 10.1007/978-3-642-40453-5_26

J. Pell, A. Hintze, R. Canino-koning, A. Howe, J. Tiedje et al., Scaling metagenome sequence assembly with probabilistic de Bruijn graphs, Proc. Natl Acad. Sci. USA, pp.13272-13277, 2012.
DOI : 10.1073/pnas.1121464109

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

P. Pevzner, H. Tang, and M. Waterman, An Eulerian path approach to DNA fragment assembly, Proc. Natl Acad. Sci. USA, pp.989748-9753, 2001.
DOI : 10.1073/pnas.171285098

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

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