The Burrows?Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching, 2008. ,
The Design and Analysis of Computer Algorithms, 1974. ,
Linear time construction of compressed text indices in compact space, Proceedings of the 46th Annual ACM Symposium on Theory of Computing, STOC '14, pp.148-193, 2014. ,
DOI : 10.1109/SWAT.1973.13
A block-sorting lossless data compression algorithm, Research Report Digital SRC, vol.124, 1994. ,
Comparison-based time?space lower bounds for selection, ACM Trans. Algorithms, vol.6, issue.2, pp.1-16, 2010. ,
DOI : 10.1145/1721837.1721842
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.8325
A Constant-Space Comparison-Based Algorithm for Computing the Burrows?Wheeler Transform, Combinatorial Pattern Matching, 24th Annual Symposium (CPM), pp.74-82, 2013. ,
DOI : 10.1007/978-3-642-38905-4_9
Optimal Time Minimal Space Selection Algorithms, Journal of the ACM, vol.28, issue.3, pp.454-461, 1981. ,
DOI : 10.1145/322261.322264
Indexing compressed text, Journal of the ACM, vol.52, issue.4, pp.552-581, 2005. ,
DOI : 10.1145/1082036.1082039
In-place suffix sorting, automata, languages and programming, 34th International Colloquium (ICALP), pp.533-545, 2007. ,
DOI : 10.1007/978-3-540-73420-8_47
High-order entropy-compressed text indexes, pp.841-850, 2003. ,
DOI : 10.1007/978-3-642-40273-9_14
The wavelet trie, Proceedings of the 31st symposium on Principles of Database Systems, PODS '12, pp.203-214, 2012. ,
DOI : 10.1145/2213556.2213586
Algorithm 64: Quicksort, Communications of the ACM, vol.4, issue.7, pp.321-322, 1961. ,
DOI : 10.1145/366622.366644
A space and time efficient algorithm for constructing compressed suffix arrays, Algorithmica, vol.48, issue.1, pp.23-36, 2007. ,
Breaking a time-and-space barrier in constructing full-text indices, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., pp.2162-2178, 2009. ,
DOI : 10.1109/SFCS.2003.1238199
Fast BWT in small space by blockwise suffix sorting, Theoretical Computer Science, vol.387, issue.3, pp.249-257, 2007. ,
DOI : 10.1016/j.tcs.2007.07.018
High Throughput Short Read Alignment via Bi-directional BWT, 2009 IEEE International Conference on Bioinformatics and Biomedicine, pp.31-36, 2009. ,
DOI : 10.1109/BIBM.2009.42
Compressed indexing and local alignment of DNA, Bioinformatics, vol.24, issue.6, pp.791-797, 2015. ,
DOI : 10.1093/bioinformatics/btn032
Fast and accurate long-read alignment with Burrows?Wheeler transform, Bioinformatics, vol.26, issue.5, pp.589-595, 2010. ,
DOI : 10.1093/bioinformatics/btp698
URL : http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2828108
Ultrafast and memory-efficient alignment of short DNA sequences to the human genome, Genome Biology, vol.10, issue.3, p.25, 2009. ,
DOI : 10.1186/gb-2009-10-3-r25
Suffix Arrays: A New Method for On-Line String Searches, SIAM Journal on Computing, vol.22, issue.5, pp.935-948, 1993. ,
DOI : 10.1137/0222058
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.6571
An analysis of the Burrows---Wheeler transform, Journal of the ACM, vol.48, issue.3, pp.407-430, 2001. ,
DOI : 10.1145/382780.382782
Selection from read-only memory and sorting with minimum data movement, Theor. Comput. Sci, vol.165, issue.2, pp.311-323, 1996. ,
DOI : 10.1016/0304-3975(95)00225-1
URL : http://doi.org/10.1016/0304-3975(95)00225-1
Alphabet-independent linear-time construction of compressed suffix arrays using o(n log n)-bit working space, Theor. Comput. Sci, vol.385, pp.1-3, 2007. ,
Wavelet trees for all, Journal of Discrete Algorithms, vol.25, pp.2-20, 2014. ,
DOI : 10.1016/j.jda.2013.07.004
Optimal dynamic sequence representations, ACM?SIAM SODA, pp.865-876, 2013. ,
DOI : 10.1137/1.9781611973105.62
URL : http://arxiv.org/abs/1206.6982
A Linear-Time Burrows-Wheeler Transform Using Induced Sorting, 16th Symposium on String Processing and Information Retrieval (SPIRE), pp.90-101, 2009. ,
DOI : 10.1109/DCC.2009.42
Improved upper bounds for time?space trade-offs for selection, Nord. J. Comput, vol.6, issue.2, pp.162-180, 1999. ,
A four-stage algorithm for updating a Burrows?Wheeler transform, Theoretical Computer Science, vol.410, issue.43, pp.4350-4359, 2009. ,
DOI : 10.1016/j.tcs.2009.07.016
URL : https://hal.archives-ouvertes.fr/hal-00469113