Fixed block compression boosting in FM-indexes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7024 LNCS, Issue , 2011, Pages 174-184

  Kärkkäinen, Juha ^a   Puglisi, Simon J ^b  

^a UNIVERSITY OF HELSINKI   (Finland)

^b KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FIXED BLOCK; FM-INDEX; OPTIMAL COMPRESSION; RANDOM ACCESS; SELF-INDEX;

PATTERN MATCHING;

INFORMATION RETRIEVAL;

EID: 80053982713     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-24583-1_18     Document Type: Conference Paper

References (16)

1. Burrows, M., Wheeler, D.J.: A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, Palo Alto, California (1994)
2. Claude, F., Navarro, G.: Practical rank/Select queries over arbitrary sequences. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol. 5280, pp. 176-187. Springer, Heidelberg (2008)
3. Ferragina, P., Giancarlo, R., Manzini, G., Sciortino, M.: Boosting textual compression in optimal linear time. Journal of the ACM 52, 688-713 (2005)
4. Ferragina, P., González, R., Navarro, G., Venturini, R.: Compressed text indexes: From theory to practice. ACM Journal of Experimental Algorithmics 13, 1.12-1.31 (2009)
5. Ferragina, P., Manzini, G.: Indexing compressed text. Journal of the ACM 52, 552-581 (2005)
6. Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Transactions on Algorithms 3, Article 20 (2007)
7. Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 841-850. SIAM, Philadelphia (2003)
8. Grossi, R., Gupta, A., Vitter, J.S.:When indexing equals compression: experiments with compressing suffix arrays and applications. In: Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 636-645. SIAM, Philadelphia (2004)
9. Kärkkäinen, J., Puglisi, S.J.: Medium-space algorithms for inverse bwt. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6346, pp. 451-462. Springer, Heidelberg (2010)
10. Mäkinen, V., Navarro, G.: Succinct suffix arrays based on run-length encoding. Nordic Journal of Computing 12, 40-66 (2005)
11. Mäkinen, V., Navarro, G.: Implicit compression boosting with applications to self-indexing. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, vol. 4726, pp. 229-241. Springer, Heidelberg (2007)
12. Manzini, G.: An analysis of the Burrows-Wheeler transform. Journal of the ACM 48, 407-430 (2001)
13. Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Computing Surveys 39 (2007)
14. Okanohara, D., Sadakane, K.: Practical entropy-compressed rank/select dictionary. In: Proc. Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM, Philadelphia (2007)
15. Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Transactions on Algorithms 3 (2007)
16. Vigna, S.: Broadword implementation of rank/select queries. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 154-168. Springer, Heidelberg (2008)