Succinct dictionary matching with no slowdown

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

Volumn 6129 LNCS, Issue , 2010, Pages 88-100

  Belazzougui, Djamal ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AHO-CORASICK; ANSWERING QUERIES; CLASSICAL PROBLEMS; CLASSICAL SOLUTIONS; DICTIONARY MATCHING; NUMBER OF STATE; QUERY TIME; STRING MATCHING; SUCCINCT DATA STRUCTURE; TOTAL LENGTH;

DATA STRUCTURES; ELECTROSTATIC DISCHARGE; PATTERN MATCHING;

QUERY PROCESSING;

EID: 78449267441     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13509-5_9     Document Type: Conference Paper

References (16)

1. Aho, A.V., Corasick, M.J.: Efficient string matching: An aid to bibliographic search. Commun. ACM 18(6), 333-340 (1975).
2. Chan, H.-L., Hon, W.-K., Lam, T.W., Sadakane, K.: Dynamic dictionary matching and compressed suffix trees. In: SODA, pp. 13-22 (2005). (Pubitemid 40851353)
3. Clark, D.R., Munro, J.I.: Efficient suffix trees on secondary storage (extended abstract). In: SODA, pp. 383-391 (1996).
4. Dori, S., Landau, G.M.: Construction of aho corasick automaton in linear time for integer alphabets. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol. 3537, pp. 168-177. Springer, Heidelberg (2005). (Pubitemid 41422523)
5. Elias, P.: Efficient storage and retrieval by content and address of static files. J. ACM 21(2), 246-260 (1974).
6. Fano, R.M.: On the number of bits required to implement an associative memory, Memorandum 61, Computer Structures Group, Project MAC. MIT, Cambridge (1971).
7. Farach, M.: Optimal suffix tree construction with large alphabets. In: FOCS, pp. 137-143 (1997).
8. Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: FOCS, pp. 390-398 (2000). (Pubitemid 32075908)
9. Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract). In: STOC, pp. 397-406 (2000).
10. Hon, W.-K., Lam, T.W., Shah, R., Tam, S.-L., Vitter, J.S.: Compressed index for dictionary matching. In: DCC, pp. 23-32 (2008).
11. Hon, W.-K., Lam, T.W., Shah, R., Tam, S.-L., Vitter, J.S.: Succinct index for dynamic dictionary matching. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878. Springer, Heidelberg (2009).
12. Jansson, J., Sadakane, K., Sung, W.-K.: Ultra-succinct representation of ordered trees. In: SODA, pp. 575-584 (2007).
13. Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. Comput. 31(3), 762-776 (2001). (Pubitemid 34750554)
14. Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: SODA, pp. 233-242 (2002).
15. Sadakane, K.: Compressed text databases with efficient query algorithms based on the compressed suffix array. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 410-421. Springer, Heidelberg (2000). (Pubitemid 33209842)
16. Tam, A., Wu, E., Lam, T.W., Yiu, S.-M.: Succinct text indexing with wildcards. In: SPIRE, pp. 39-50 (2009).