Practical Compressed Suffix Trees, Algorithms, vol.6, issue.2, pp.319-351, 2013. ,
Replacing suffix trees with enhanced suffix arrays, Journal of Discrete Algorithms, vol.2, issue.1, pp.53-86, 2004. ,
Space Efficient Modifications to Structator -A Fast Index-Based Search Tool for RNA Sequence-Structure Patterns, 11th International Symposium on Experimental Algorithms, (SEA), pp.27-38, 2012. ,
A block-sorting lossless data compression algorithm, Digital Equipment Corporation, 1994. ,
Full compressed affix tree representations, 2017 Data Compression Conference, pp.102-111, 2017. ,
Prediction of Rho-independent Escherichia coli Transcription Terminators, Journal of Molecular Biology, vol.216, issue.4, pp.835-858, 1990. ,
Shortest DNA cyclic cover in compressed space, Data Compression Conference DCC, pp.536-545, 2016. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01314330
Compressed Text Indexes: From Theory to Practice, ACM Journal of Experimental Algorithmics (JEA), vol.13, p.12, 2009. ,
Trie memory, Communications of the ACM 3, pp.490-500, 1960. ,
Multi-pattern matching with bidirectional indexes, Journal of Discrete Algorithms, vol.24, pp.26-39, 2014. ,
High-order entropy-compressed text indexes, Proc. 14th Symposium on Discrete Algorithms (SODA), pp.841-850, 2003. ,
Sorting and Searching, The Art of Computer Programming, vol.3, 1973. ,
High Throughput Short Read Alignment via Bi-directional BWT, Bioinformatics and Biomedicine, pp.31-36, 2009. ,
DOI : 10.1109/bibm.2009.42
Linear Bidirectional On-Line Construction of Affix Trees, Algorithmica, vol.37, issue.1, pp.43-74, 2003. ,
Suffix arrays: a new method for on-line string searches, SIAM Journal on Computing, pp.935-948, 1993. ,
A space-economical suffix tree construction algorithm, Journal of the ACM, vol.32, issue.2, pp.262-272, 1976. ,
Compressed Full-Text Indexes, ACM Computing Surveys, vol.39, issue.1, 2007. ,
, Proc. 17th International Symposium, SPIRE 2010, pp.322-333, 2010.
Constant-time and space-efficient unidirectional and bidirectional FM-indices using EPR-dictionaries, 2016. ,
Fully-Compressed Suffix Trees, ACM Transactions on Algorithms (TALG), vol.7, issue.4, p.53, 2011. ,
Compressed suffix trees with full functionality. Theory of Computing Systems, vol.41, pp.589-607, 2007. ,
Bidirectional search in a string with wavelet trees and bidirectional matching statistics, Information and Computation, vol.213, pp.13-22, 2012. ,
Affix Trees, 2000. ,
The affix array data structure and its applications to RNA secondary structure analysis, Theoretical Computer Science, vol.389, issue.1-2, pp.278-294, 2007. ,
Linear pattern matching algorithms, Proc. 14th Annual Symposium on Switching and Automata Theory, pp.1-11, 1973. ,