G. Bresler, D. Ma-'ayan-bresler, and . Tse, Optimal assembly for high throughput shotgun sequencing, BMC Bioinformatics, vol.14, p.18, 2013.

B. Jacek, P. La?-zewicz, M. Formanowicz, P. Kasprzak, G. J. Schuurman et al., DNA sequencing, Eulerian graphs, and the exact perfect matching problem, Graph-Theoretic Concepts in Computer Science, pp.13-24, 2002.

B. Jacek, P. La?-zewicz, M. Formanowicz, D. Kasprzak, and . Kobler, On the recognition of de Bruijn graphs and their induced subgraphs, Discrete Mathematics, vol.245, issue.1, pp.81-92, 2002.

[. Blazewicz, A. Hertz, D. Kobler, and D. De-werra, On some properties of DNA graphs, Discrete Applied Mathematics, vol.98, issue.1-2, pp.1-19, 1999.
DOI : 10.1016/S0166-218X(99)00109-2

D. V. Marília, J. Braga, and . Meidanis, An algorithm that builds a set of strings given its overlap graph, Theoretical Informatics, 5th Latin American Symposium Proceedings, pp.52-63, 2002.

A. John, U. S. Bondy, and . Murty, Graph Theory, Graduate Texts in Mathematics, vol.244, 2008.

P. Theodoros, L. S. Gevezes, and . Pitsoulis, Recognition of overlap graphs, Journal of Combinatorial Optimization, vol.28, issue.1, pp.25-37, 2014.

M. Ramana, M. S. Idury, and . Waterman, A new algorithm for DNA sequence assembly, Journal of Computational Biology, vol.2, issue.2, pp.291-306, 1995.

X. Li and H. Zhang, Characterizations for Some Types of DNA Graphs, Journal of Mathematical Chemistry, vol.127, issue.1, pp.65-79, 2007.
DOI : 10.1007/s10910-006-9099-4

X. Li and H. Zhang, Embedding on alphabet overlap digraphs, Journal of Mathematical Chemistry, vol.56, issue.1, pp.62-71, 2010.
DOI : 10.1007/s10910-009-9530-8

[. Medvedev, K. Georgiou, G. Myers, and M. Brudno, Computability of Models for Sequence Assembly, Algorithms in Bioinformatics, pp.289-301, 2007.
DOI : 10.1007/978-3-540-74126-8_27

R. Jason, S. Miller, G. Koren, and . Sutton, Assembly algorithms for next-generation sequencing data, Genomics, vol.95, issue.6, pp.315-327, 2010.

E. W. Myers, The fragment assembly string graph, Bioinformatics, vol.21, issue.Suppl 2, p.85, 2005.
DOI : 10.1093/bioinformatics/bti1114

[. Nagarajan and M. Pop, Parametric Complexity of Sequence Assembly: Theory and Applications to Next Generation Sequencing, Journal of Computational Biology, vol.16, issue.7, pp.897-908, 2009.
DOI : 10.1089/cmb.2009.0005

N. Nagarajan and M. Pop, Sequence assembly demystified, Nature Reviews Genetics, vol.23, issue.3, pp.157-167, 2013.
DOI : 10.1093/bioinformatics/btm451

R. Pendavingh, P. Schuurman, and G. J. Woeginger, Recognizing DNA graphs is difficult, Discrete Applied Mathematics, vol.127, issue.1, pp.85-94, 2003.
DOI : 10.1016/S0166-218X(02)00287-1
URL : https://doi.org/10.1016/s0166-218x(02)00287-1

[. Sweedyk, \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring, SIAM Journal on Computing, vol.29, issue.3, pp.954-986, 2000.
DOI : 10.1137/S0097539796324661

J. Tarhio and E. Ukkonen, A greedy approximation algorithm for constructing shortest common superstrings, Theoretical Computer Science, vol.57, issue.1, pp.131-145, 1988.
DOI : 10.1016/0304-3975(88)90167-3