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
Computing the longest common prefix array based on the Burrows-Wheeler transform, 18th Intl. Symp. String Processing and Information Retrieval, pp.197-208, 2011. ,
-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
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
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
Succinct data structures for assembling large genomes, Bioinformatics, vol.27, issue.4, pp.479-486, 2011. ,
DOI : 10.1093/bioinformatics/btq697
Opportunistic data structures with applications, Proceedings 41st Annual Symposium on Foundations of Computer Science, pp.390-398, 2000. ,
DOI : 10.1109/SFCS.2000.892127
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
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
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
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
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=10.1.1.10.3680
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=10.1.1.156.4253
Succinct Static Data Structures, 1989. ,
Implementation of BCR. https://github.com/lh3/ropebwt, p.14 ,
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
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
Efficient counting of k-mers in dna sequences using a bloom filter, BMC Bioinformatics, vol.12, issue.1 3, p.333, 2011. ,
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=10.1.1.144.186
CRAC: an integrated approach to read analysis, Genome Biology, issue.10, 2013. ,
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
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
Correcting errors in short reads by multiple alignments, Bioinformatics, vol.27, issue.11, pp.1455-1461, 2011. ,
DOI : 10.1093/bioinformatics/btr170
Compressed Full-Text Indexes for Highly Repetitive Collections, p.14, 2012. ,
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