D. Belazzougui, F. Cunial, J. Kärkkäinen, and V. Mäkinen, Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform, Proc. 21st European Symposium on Algorithms (ESA), pp.133-144, 2013.
DOI : 10.1007/978-3-642-40450-4_12

M. Burrow and D. Wheeler, A block-sorting lossless data compression algorithm, 1994.

L. H. Chen, Poisson approximation for dependent trials. The Annals of Probability, pp.534-545, 1975.
DOI : 10.1214/aop/1176996359

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=10.1.1.23.7615

T. W. Lam, R. Li, A. Tam, S. C. Wong, E. Wu et al., 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

T. W. Lam, W. K. Sung, and S. S. Wong, Improved approximate string matching using compressed suffix data structures, Proc. 16th International Symposium on Algorithms and Computation (ISAAC), pp.339-348, 2005.
DOI : 10.1007/11602613_35

B. Langmead, C. Trapnell, M. Pop, and S. Salzberg, 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

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

H. Li and N. Homer, A survey of sequence alignment algorithms for next-generation sequencing, Briefings in Bioinformatics, vol.11, issue.5, pp.473-483, 2010.
DOI : 10.1093/bib/bbq015

G. Navarro and V. Mäkinen, Compressed full-text indexes, ACM Computing Surveys, vol.39, issue.1, 2007.
DOI : 10.1145/1216370.1216372
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.186

L. M. Russo, G. Navarro, A. L. Oliveira, and P. Morales, Approximate String Matching with Compressed Indexes, Algorithms, vol.2, issue.3, pp.1105-1136, 2009.
DOI : 10.3390/a2031105
URL : http://doi.org/10.3390/a2031105

T. Schnattinger, E. Ohlebusch, and S. Gog, Bidirectional search in a string with wavelet trees and bidirectional matching statistics, Information and Computation, vol.213, pp.13-22, 2012.
DOI : 10.1016/j.ic.2011.03.007

J. T. Simpson and R. Durbin, Efficient de novo assembly of large genomes using compressed data structures, Genome Research, vol.22, issue.3, pp.549-556, 2012.
DOI : 10.1101/gr.126953.111

W. Sung, Indexed approximate string matching, Encyclopedia of Algorithms, pp.1-99, 2008.
DOI : 10.1007/978-0-387-30162-4_188