M. J. Bauer, A. J. Cox, and G. Rosone, Lightweight BWT Construction for Very Large String Collections, Proc. 22nd Annual Symposium on Combinatorial Pattern Matching (CPM), pp.219-231, 2011.
DOI : 10.1007/978-3-642-03784-9_7

T. Beller, S. Gog, E. Ohlebusch, and T. Schnattinger, Computing the longest common prefix array based on the Burrows-Wheeler transform, 18th Intl. Symp. String Processing and Information Retrieval, pp.197-208, 2011.

S. Burkhardt, A. Crauser, P. Ferragina, H. Lenhof, E. Rivals et al., -gram based database searching using a suffix array (QUASAR), Proceedings of the third annual international conference on Computational molecular biology , RECOMB '99, pp.77-83, 1999.
DOI : 10.1145/299432.299460

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

R. Chikhi and D. Lavenier, Localized Genome Assembly from Reads to Scaffolds: Practical Traversal of the Paired String Graph, WABI, pp.39-48, 2011.
DOI : 10.1101/gr.074492.107

URL : https://hal.archives-ouvertes.fr/inria-00637535

F. Claude, A. Fariña, M. A. Martínez-prieto, and G. Navarro, Compressed q-Gram Indexing for Highly Repetitive Biological Sequences, 2010 IEEE International Conference on BioInformatics and BioEngineering, pp.86-91, 2010.
DOI : 10.1109/BIBE.2010.22

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

P. Ferragina and G. Manzini, Opportunistic data structures with applications, Proceedings 41st Annual Symposium on Foundations of Computer Science, pp.390-398, 2000.
DOI : 10.1109/SFCS.2000.892127

J. Fischer, V. Mäkinen, and G. Navarro, Faster entropy-bounded compressed suffix trees, Theoretical Computer Science, vol.410, issue.51, pp.5354-5364, 2009.
DOI : 10.1016/j.tcs.2009.09.012

URL : http://doi.org/10.1016/j.tcs.2009.09.012

R. Grossi, A. Gupta, and J. S. Vitter, High-order entropy-compressed text indexes, 14th Ann. ACM-SIAM Symp. on Discrete Algorithms, pp.841-850, 2003.
DOI : 10.1007/978-3-642-40273-9_14

S. Hazelhurst and Z. Lipták, KABOOM! A new suffix array based algorithm for clustering expression data, Bioinformatics, vol.27, issue.24, pp.3348-3355, 2011.
DOI : 10.1093/bioinformatics/btr560

W. Hon, T. Lam, K. Sadakane, W. Sung, and S. Yiu, A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays, Algorithmica, vol.48, issue.1, pp.23-36, 2007.
DOI : 10.1007/s00453-006-1228-8

W. Hon and K. Sadakane, Space-Economical Algorithms for Finding Maximal Unique Matches, CPM, LNCS 2373, pp.144-152, 2002.
DOI : 10.1007/3-540-45452-7_13

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

W. Hon, R. Shah, and J. S. Vitter, Space-efficient framework for topk string retrieval problems, FOCS, pp.713-722, 2009.
DOI : 10.1109/focs.2009.19

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

G. Jacobson, Succinct Static Data Structures, 1989.

H. Li, Implementation of BCR. https://github.com/lh3/ropebwt, p.14

H. Li and R. Durbin, Fast and accurate short read alignment with Burrows-Wheeler transform, Bioinformatics, vol.25, issue.14, pp.1754-1760, 2009.
DOI : 10.1093/bioinformatics/btp324

URL : http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2705234

G. Marçais and C. Kingsford, A fast, lock-free approach for efficient parallel counting of occurrences of k-mers, Bioinformatics, vol.27, issue.6, pp.764-770, 2011.
DOI : 10.1093/bioinformatics/btr011

&. E. Välimäki, ]. Rivals, J. Melsted, and . Pritchard, Efficient counting of k-mers in dna sequences using a bloom filter, BMC Bioinformatics, vol.12, issue.1 3, p.333, 2011.

G. Navarro and V. Mäkinen, Compressed full-text indexes, ACM Computing Surveys, vol.39, issue.1, p.10, 2007.
DOI : 10.1145/1216370.1216372

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

N. Philippe, M. Salson, T. Commes, and E. Rivals, CRAC: an integrated approach to read analysis, Genome Biology, issue.10, 2013.

N. Philippe, M. Salson, T. Lecroq, M. Léonard, T. Commes et al., Querying large read collections in main memory: a versatile data structure, BMC Bioinformatics, vol.12, issue.1, pp.242-257, 2011.
DOI : 10.1093/bioinformatics/btr170

URL : https://hal.archives-ouvertes.fr/lirmm-00632958

G. Rizk, D. Lavenier, and R. Chikhi, DSK: k-mer counting with very low memory usage, Bioinformatics, vol.29, issue.5, p.page Advance access, 2003.
DOI : 10.1093/bioinformatics/btt020

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

L. Salmela and J. Schröder, Correcting errors in short reads by multiple alignments, Bioinformatics, vol.27, issue.11, pp.1455-1461, 2011.
DOI : 10.1093/bioinformatics/btr170

J. Sirén, Compressed Full-Text Indexes for Highly Repetitive Collections, p.14, 2012.

D. E. Willard, Log-logarithmic worst-case range queries are possible in space ??(N), Information Processing Letters, vol.17, issue.2, pp.81-84, 1983.
DOI : 10.1016/0020-0190(83)90075-3