Improved ESP-index: A practical self-index for highly repetitive texts

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

Volumn 8504 LNCS, Issue , 2014, Pages 338-350

  Takabatake, Yoshimasa ^a   Tabei, Yasuo ^b   Sakamoto, Hiroshi ^a  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BINARY SEARCH; LARGE ALPHABETS; PARSING ALGORITHM; QUERY SEARCH; SEARCH QUERIES; SUCCINCT DATA STRUCTURE; TOP-DOWN SEARCHES; UPPER BOUND;

FORMAL LANGUAGES;

EID: 84903724729     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-07959-2_29     Document Type: Conference Paper

References (18)

1. Barbay, J., Navarro, G.: On compressing permutations and adaptive sorting. Theor. Comp. Sci. 513, 109-123 (2013)
2. Claude, F., Navarro, G.: Self-indexed grammar-based compression. Fundam. Inform. 111, 313-337 (2010)
3. Claude, F., Navarro, G.: Improved grammar-based compressed indexes. In: Calderón-Benavides, L., González-Caro, C., Chávez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol. 7608, pp. 180-192. Springer, Heidelberg (2012)
4. Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. TALG 3, 2:1-2:19 (2007)
5. Delpratt, O., Rahman, N., Raman, R.: Engineering the louds succinct tree representation. In: Àlvarez, C., Serna, M. (eds.) WEA 2006. LNCS, vol. 4007, pp. 134-145. Springer, Heidelberg (2006) (Pubitemid 44070933)
6. Gagie, T., Gawrychowski, P., Kärkkäinen, J., Nekrich, Y., Puglisi, S.J.: A faster grammar-based self-index. In: Dediu, A.-H., Martín-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 240-251. Springer, Heidelberg (2012)
7. Gagie, T., Gawrychowski, P., Kärkkäinen, J., Nekrich, Y., Puglisi, S.J.: LZ77-based self-indexing with faster pattern matching. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 731-742. Springer, Heidelberg (2014)
8. Golynski, A., Munro, J.I., Rao, S.S.: Rank/select operations on large alphabets: a tool for text indexing. In: SODA, pp. 368-373 (2006)
9. Goto, K., Bannai, H., Inenaga, S., Takeda, M.: Fast q-gram mining on SLP compressed strings. JDA 18, 89-99 (2013)
10. Hermelin, D., Landau, G.M., Landau, S., Weimann, O.: A unified algorithm for accelerating edit-distance computation via text-compression. In: STACS, pp. 529-540 (2009)
11. Jacobson, G.: Space-efficient static trees and graphs. In: FOCS, pp. 549-554 (1989)
12. Larsson, N.J., Moffat, A.: Off-line dictionary-based compression. In: DCC, pp. 296-305 (1999)
13. Maruyama, S., Nakahara, M., Kishiue, N., Sakamoto, H.: ESP-Index: A compressed index based on edit-sensitive parsing. JDA 18, 100-112 (2013)
14. Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Succinct representations of permutations. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 345-356. Springer, Heidelberg (2003)
15. Navarro, G.: Indexing text using the ziv-lempel trie. JDA 2, 87-114 (2004)
16. Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. TALG 3 (2007)
17. Sakamoto, H., Maruyama, S., Kida, T., Shimozono, S.: A space-saving approximation algorithm for grammar-based compression. IEICE Trans. Inf. Syst. E92-D, 158-165 (2009)
18. Yamamoto, T., Bannai, H., Inenaga, S., Takeda, M.: Faster subsequence and don't-care pattern matching on compressed texts. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 309-322. Springer, Heidelberg (2011)