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
Variable-order de bruijn graphs CoRR abs, p.2718, 1411. ,
DOI : 10.1109/dcc.2015.70
URL : http://arxiv.org/abs/1411.2718
Shortest DNA Cyclic Cover in Compressed Space, 2016 Data Compression Conference (DCC), pp.536-545, 2016. ,
DOI : 10.1109/DCC.2016.79
URL : https://hal.archives-ouvertes.fr/lirmm-01314330
From Indexing Data Structures to de Bruijn Graphs, CPM 2014, pp.89-99, 2014. ,
DOI : 10.1007/978-3-319-07566-2_10
URL : https://hal.archives-ouvertes.fr/lirmm-00950983
A linear time algorithm for Shortest Cyclic Cover of Strings, Journal of Discrete Algorithms, vol.37, 2016. ,
DOI : 10.1016/j.jda.2016.05.001
URL : https://hal.archives-ouvertes.fr/lirmm-01240278
The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings, Discrete Applied Mathematics, vol.212, 2015. ,
DOI : 10.1016/j.dam.2015.06.003
URL : https://hal.archives-ouvertes.fr/lirmm-01286943
On finding minimal length superstrings, Journal of Computer and System Sciences, vol.20, issue.1, pp.50-58, 1980. ,
DOI : 10.1016/0022-0000(80)90004-5
URL : http://doi.org/10.1016/0022-0000(80)90004-5
An efficient algorithm for the All Pairs Suffix-Prefix Problem, Information Processing Letters, vol.41, issue.4, pp.181-185, 1992. ,
DOI : 10.1016/0020-0190(92)90176-V
Manifold de Bruijn Graphs, WABI 2014, pp.296-310, 2014. ,
DOI : 10.1007/978-3-662-44753-6_22
Greedy in Approximation Algorithms, ESA 2006, pp.528-539, 2006. ,
DOI : 10.1007/11841036_48
Genome 10K: A Proposal to Obtain Whole-Genome Sequence for 10 000 Vertebrate Species, Journal of Heredity, vol.100, issue.6, pp.659-674, 2009. ,
DOI : 10.1093/jhered/esp086
Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2, WG 1999 Cazaux et al, pp.55-64, 1999. ,
DOI : 10.1007/3-540-46784-X_7
IDBA ??? A Practical Iterative de Bruijn Graph De Novo Assembler, RECOMB 2010, pp.426-440, 2010. ,
DOI : 10.1007/978-3-642-12683-3_28
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
URL : http://doi.org/10.1016/0304-3975(88)90167-3