Faster compressed dictionary matching

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

Volumn 6393 LNCS, Issue , 2010, Pages 191-200

  Hon, Wing Kai ^a   Ku, Tsung Han ^a   Shah, Rahul ^b   Thankachan, Sharma V ^b   Vitter, Jeffrey Scott ^c  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b LOUISIANA STATE UNIVERSITY   (United States)

^c UNIVERSITY OF KANSAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DICTIONARY MATCHING; INDEX SPACE; QUERY TIME; SPACE AND TIME; BIT INDICES;

INFORMATION RETRIEVAL; TOWERS;

OPTIMIZATION; ALUMINUM;

EID: 78449304418     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16321-0_19     Document Type: Conference Paper

References (18)

1. Aho, A., Corasick, M.: Efficient String Matching: An Aid to Bibliographic Search. Communications of the ACM 18(6), 333-340 (1975)
2. Amir, A., Farach, M., Matias, Y.: Efficient Randomized Dictionary Matching Algorithms (Extended Abstract). In: Apostolico, A., Galil, Z., Manber, U., Crochemore, M. (eds.) CPM 1992. LNCS, vol. 644, pp. 262-275. Springer, Heidelberg (1992)
3. Belazzougui, D.: Succinct Dictionary Matching With No Slowdown. In: Amir, A., Parida, L. (eds.) Combinatorial Pattern Matching. LNCS, vol. 6129, pp. 88-100. Springer, Heidelberg (2010)
4. Burrows, M., Wheeler, D.J.: A Block-sorting Lossless Data Compression Algorithm. Technical Report 124, Digital Equipment Corporation, Paolo Alto, CA, USA (1994)
5. Chan, H.L., Hon, W.K., Lam, T.W., Sadakane, K.: Compressed Indexes for Dynamic Text Collections. ACM Transactions on Algorithms 3(2) (2007)
6. Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Structuring Labeled Trees for Optimal Succinctness, and Beyond. In: Proceedings of Symposium on Foundations of Computer Science, pp. 184-196 (2005)
7. Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Compressing and Indexing Labeled Trees, With Applications. Journal of the ACM 57(1) (2009)
8. Ferragina, P., Manzini, G.: Indexing Compressed Text. Journal of the ACM 52(4), 552-581 (2005); A preliminary version appears in FOCS 2000
9. Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed Representations of Sequences and Full-Text Indexes. ACM Transactions on Algorithms 3(2) (2007)
10. Grossi, R., Vitter, J.S.: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. SIAM Journal on Computing 35(2), 378-407 (2005); A preliminary version appears in STOC 2000
11. Gupta, A., Hon, W.K., Shah, R., Vitter, J.S.: A Framework for Dynamizing Succinct Data Structures. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 521-532. Springer, Heidelberg (2007)
12. Hon, W.-K., Lam, T.-W., Shah, R., Tam, S.-L., Vitter, J.S.: Compressed Index for Dictionary Matching. In: Proceedings of Data Compression Conference, pp. 23-32 (2008)
13. Jacobson, G.: Space-efficient Static Trees and Graphs. In: Proceedings of Symposium on Foundations of Computer Science, pp. 549-554 (1989)
14. McCreight, E.M.: A Space-economical Suffix Tree Construction Algorithm. Journal of the ACM 23(2), 262-272 (1976)
15. Raman, R., Raman, V., Rao, S.S.: Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees and Multisets. In: Proceedings of Symposium on Discrete Algorithms, pp. 233-242 (2002)
16. Tam, A., Wu, E., Lam, T.W., Yiu, S.M.: Succinct Text Indexing With Wildcards. In: Karlgren, J., Tarhio, J., Hyyrö, H. (eds.) String Processing and Information Retrieval. LNCS, vol. 5721, pp. 39-50. Springer, Heidelberg (2009)
17. Weiner, P.: Linear Pattern Matching Algorithms. In: Proceedings of Symposium on Switching and Automata Theory, pp. 1-11 (1973)
18. Witten, I., Moffat, A., Bell, T.: Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers, Los Altos (1999)