E. Birmelé, P. Crescenzi, R. Ferreira, R. Grossi, V. Lacroix et al., Efficient Bubble Enumeration in Directed Graphs, pp.118-129, 2012.
DOI : 10.1007/978-3-642-34109-0_13

B. Bollobás, Modern graph theory, Graduate Texts in Mathematics, vol.184, 1998.
DOI : 10.1007/978-1-4612-0619-4

J. A. Bondy and U. S. Murty, Graph Theory with Applications, 1976.
DOI : 10.1007/978-1-349-03521-2

L. Brankovic, C. S. Iliopoulos, R. Kundu, M. Mohamed, S. P. Pissis et al., Linear-time superbubble identification algorithm for genome assembly, Theoretical Computer Science, vol.609, pp.374-383, 2016.
DOI : 10.1016/j.tcs.2015.10.021

URL : https://doi.org/10.1016/j.tcs.2015.10.021

N. Deo, Graph theory with applications to engineering and computer science. Prentice-Hall series in automatic computation, 1974.

P. M. Gleiss, J. Leydold, and P. F. Stadler, Circuit bases of strongly connected digraphs, Discussiones Mathematicae Graph Theory, vol.23, issue.2, pp.241-260, 2003.
DOI : 10.7151/dmgt.1200

Z. Iqbal, M. Caccamo, I. Turner, P. Flicek, and G. Mcvean, De novo assembly and genotyping of variants using colored de Bruijn graphs, Nature Genetics, vol.44, issue.2, pp.226-232, 2012.
DOI : 10.1016/0198-8859(91)90078-N

URL : https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3272472/pdf

T. Kavitha, C. Liebchen, K. Mehlhorn, D. Michail, R. Rizzi et al., Cycle bases in graphs characterization, algorithms, complexity, and applications, Computer Science Review, vol.3, issue.4, pp.199-243, 2009.
DOI : 10.1016/j.cosrev.2009.08.001

URL : http://www.mpi-inf.mpg.de/~mehlhorn/ftp/SurveyCycleBases.pdf

T. Kavitha and K. Mehlhorn, Algorithms to Compute Minimum Cycle Basis in Directed Graphs, Theory of Computing Systems, vol.40, issue.4, pp.485-505, 2007.
DOI : 10.1007/s00224-006-1319-6

URL : http://www.mpi-sb.mpg.de/~mehlhorn/ftp/DirCycleBasis.ps

H. Li, Exploring single-sample SNP and INDEL calling with whole-genome de novo assembly, Bioinformatics, vol.28, issue.14, pp.1838-1844, 2012.
DOI : 10.1093/bioinformatics/bts280

URL : https://academic.oup.com/bioinformatics/article-pdf/28/14/1838/582806/bts280.pdf

L. Lima, B. Sinaimeri, G. Sacomoto, H. Lopez-maestre, C. Marchet et al., Playing hide and seek with repeats in local and global de novo transcriptome assembly of short RNA-seq reads, Algorithms for Molecular Biology, vol.7, issue.20, 2017.
DOI : 10.1038/ncomms11067

URL : https://hal.archives-ouvertes.fr/hal-01474524

S. Maclane, A combinatorial condition for planar graphs, Fundamenta Mathematicae, vol.28, pp.22-32, 1937.

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

URL : http://arxiv.org/pdf/1307.7925.pdf

P. A. Pevzner, H. Tang, and G. Tesler, De Novo Repeat Classification and Fragment Assembly, Genome Research, vol.14, issue.9, pp.1786-1796, 2004.
DOI : 10.1101/gr.2395204

URL : https://www.ncbi.nlm.nih.gov/pmc/articles/PMC515325/pdf

G. Sacomoto, V. Lacroix, and M. F. Sagot, A Polynomial Delay Algorithm for the Enumeration of Bubbles with Length Constraints in Directed Graphs and Its Application to the Detection of Alternative Splicing in RNA-seq Data, pp.99-111, 2013.
DOI : 10.1007/978-3-642-40453-5_9

URL : https://hal.archives-ouvertes.fr/hal-00842982

G. Sacomoto, J. Kielbassa, R. Chikhi, R. Uricaru, P. Antoniou et al., Kissplice: de-novo calling alternative splicing events from rna-seq data, BMC Bioinformatics, vol.13, p.5, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00784407

M. Sammeth, Complete Alternative Splicing Events Are Bubbles in Splicing Graphs, Journal of Computational Biology, vol.16, issue.8, pp.1117-1140, 2009.
DOI : 10.1089/cmb.2009.0108

URL : http://genome.crg.es/astalavista/reprints/jcb_sammeth_corrected.pdf

J. T. Simpson, K. Wong, S. D. Jackman, J. E. Schein, S. J. Jones et al., ABySS: A parallel assembler for short read sequence data, Genome Research, vol.19, issue.6, pp.1117-1123, 2009.
DOI : 10.1101/gr.089532.108

URL : http://genome.cshlp.org/content/19/6/1117.full.pdf

W. K. Sung, K. Sadakane, T. Shibuya, A. Belorkar, and I. Pyrogova, An <inline-formula><tex-math notation="LaTeX">$\bm{O(m\, \log\, m)}$</tex-math><alternatives> <inline-graphic xlink:type="simple" xlink:href="sung-ieq1-2385696.gif"/></alternatives></inline-formula>-Time Algorithm for Detecting Superbubbles, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.12, issue.4, pp.770-777, 2015.
DOI : 10.1109/TCBB.2014.2385696

R. Uricaru, G. Rizk, V. Lacroix, E. Quillery, O. Plantard et al., Reference-free detection of isolated SNPs, Nucleic Acids Research, vol.43, issue.2, p.11, 2015.
DOI : 10.1093/nar/gku1187

URL : https://hal.archives-ouvertes.fr/hal-01083715

R. Younsi and D. Maclean, Using 2k???+???2 bubble searches to find single nucleotide polymorphisms in k-mer graphs, Bioinformatics, vol.31, issue.5, pp.642-646, 2015.
DOI : 10.1093/bioinformatics/btu706

URL : https://academic.oup.com/bioinformatics/article-pdf/31/5/642/17124203/btu706.pdf

D. Zerbino and E. Birney, Velvet: Algorithms for de novo short read assembly using de Bruijn graphs, Genome Research, vol.18, issue.5, 2008.
DOI : 10.1101/gr.074492.107

URL : http://genome.cshlp.org/content/18/5/821.full.pdf