C. Maher, C. Kumar-sinha, X. Cao, S. Kalyana-sundaram, B. Han et al., Transcriptome sequencing to detect gene fusions in cancer, Nature, vol.3, issue.7234, pp.45897-101, 2009.
DOI : 10.1038/nature07638

S. Altschul, W. Gish, W. Miller, E. Myers, and D. Lipman, Basic local alignment search tool, Journal of Molecular Biology, vol.215, issue.3, pp.403-410, 1990.
DOI : 10.1016/S0022-2836(05)80360-2

S. Burkhardt, A. Crauser, P. Ferragina, H. Lenhof, and E. Rivals, Vingron M: q-gram Based Database Searching Using a Suffix Array (QUASAR), 3rd Annual Int Conf on Computational Molecular Biology ACM Press, pp.77-83, 1999.
DOI : 10.1145/299432.299460

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

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

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

F. Hach, F. Hormozdiari, C. Alkan, F. Hormozdiari, I. Birol et al., mrsFAST: a cache-oblivious algorithm for short-read mapping, Nature Methods, vol.19, issue.8, pp.576-577, 2010.
DOI : 10.1038/nmeth0810-576

U. Manber and G. Myers, Suffix Arrays: A New Method for On-Line String Searches, Proceedings of the first annual ACM-SIAM Symposium on Discrete Algorithms, pp.319-327, 1990.
DOI : 10.1137/0222058

D. Gusfield, Algorithms on Strings, Trees and Sequences, 1997.
DOI : 10.1017/CBO9780511574931

F. Shi, Suffix arrays for multiple strings: A method for on-line multiple string searches, ASIAN, pp.11-22, 1996.
DOI : 10.1007/BFb0027775

P. Ferragina, R. González, G. Navarro, and R. Venturini, Compressed text indexes, Journal of Experimental Algorithmics, vol.13, pp.12-13, 2009.
DOI : 10.1145/1412228.1455268

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

R. Homann, D. Fleer, R. Giegerich, and M. Rehmsmeier, mkESA: enhanced suffix array construction tool, Bioinformatics, vol.25, issue.8, pp.1084-1085, 2009.
DOI : 10.1093/bioinformatics/btp112

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

N. Philippe, A. Boureux, J. Tarhio, L. Bréhélin, T. Commes et al., Using reads to annotate the genome: influence of length, background distribution, and sequence errors on prediction capacity, Nucleic Acids Research, vol.37, issue.15, pp.37-104, 2009.
DOI : 10.1093/nar/gkp492

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

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

F. Denoeud, J. Aury, D. Silva, C. Noel, B. Rogier et al., Annotating genomes with massive-scale RNA sequencing, Genome Biology, vol.9, issue.12, p.175, 2008.
DOI : 10.1186/gb-2008-9-12-r175

C. Trapnell, B. Williams, G. Pertea, A. Mortazavi, G. Kwan et al., Transcript assembly and quantification by RNA-Seq reveals unannotated transcripts and isoform switching during cell differentiation, Nature Biotechnology, vol.25, issue.5, pp.511-515, 2010.
DOI : 10.1038/nbt.1621

J. Miller, S. Koren, and G. Sutton, Assembly algorithms for next-generation sequencing data, Genomics, vol.95, issue.6, pp.315-327
DOI : 10.1016/j.ygeno.2010.03.001

T. Conway and A. Bromage, Succinct data structures for assembling large genomes, Bioinformatics, vol.27, issue.4, pp.479-486, 2011.
DOI : 10.1093/bioinformatics/btq697

G. Marcais 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

T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms. 2 edition, 2001.

. Munro, Tables, Proc. of Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp.37-42, 1996.
DOI : 10.1007/3-540-62034-6_35

R. Raman, V. Raman, and S. Rao, -ary trees, prefix sums and multisets, Proc of Symposium on Discrete Algorithms (SODA) 2002, pp.233-242
DOI : 10.1145/1290672.1290680

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

G. Manzini, Two Space Saving Tricks for Linear Time LCP Array Computation, Proc 9th Scandinavian Workshop on Algorithm Theory, pp.372-383, 2004.
DOI : 10.1007/978-3-540-27810-8_32

S. Kurtz, A. Phillippy, A. Delcher, M. Smoot, M. Shumway et al., Versatile and open software for comparing large genomes

T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park, Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications, Proc of the 12th Symposium on Combinatorial Pattern Matching, pp.181-192, 2001.
DOI : 10.1007/3-540-48194-X_17

S. Puglisi, W. Smyth, and A. Turpin, A taxonomy of suffix array construction algorithms, ACM Computing Surveys, vol.39, issue.2, pp.1-31, 2007.
DOI : 10.1145/1242471.1242472

H. Li and N. Homer, A survey of sequence alignment algorithms for nextgeneration sequencing, Brief Bioinf, vol.2010, issue.115, pp.473-483

J. Schröder, H. Schröder, S. Puglisi, R. Sinha, and B. Schmidt, SHREC: a short-read error correction method, Bioinformatics, vol.25, issue.17, pp.252157-2163, 2009.
DOI : 10.1093/bioinformatics/btp379

L. Ilie, F. Fazayeli, and S. Ilie, HiTEC: accurate error correction in high-throughput sequencing data, Bioinformatics, vol.27, issue.3, pp.295-302, 2011.
DOI : 10.1093/bioinformatics/btq653

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