Succinct index for dynamic dictionary matching

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

Volumn 5878 LNCS, Issue , 2009, Pages 1034-1043

  Hon, Wing Kai ^a   Lam, Tak Wah ^b   Shah, Rahul ^c   Tam, Siu Lung ^b   Vitter, Jeffrey Scott ^d  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

^c LOUISIANA STATE UNIVERSITY   (United States)

^d TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALPHABET SIZE; COMPRESSED SUFFIX ARRAY; DYNAMIC DICTIONARIES; FM-INDEX; NEW INDICES; SPACE COMPLEXITY; TIME COMPLEXITY; TOTAL LENGTH;

COMPUTATION THEORY; INDEXING (OF INFORMATION);

COMPUTATIONAL EFFICIENCY;

EID: 75749102981     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10631-6_104     Document Type: Conference Paper

References (20)

1. Aho, A., Corasick, M.: Efficient String Matching: An Aid to Bibliographic Search. Communications of the ACM 18(6), 333-340 (1975)
2. Alstrup, S., Husfeldt, T., Rauhe, T.: Marked Ancestor Problems. In: Proceedings of Symposium on Foundations of Computer Science, pp. 534-544 (1998)
3. Amir, A., Farach, M., Idury, R., La Poutre, A., Schaffer, A.: Improved Dynamic Dictionary Matching. Information and Computation 119(2), 258-282 (1995)
4. Arge, L., Vitter, J.S.: Optimal External Memory Interval Management. SIAM Journal on Computing, 1488-1508 (2003)
5. Bender, M.A., Cole, R., Demaine, E.D., Farach-Colton, M., Zito, J.: Two Simplified Algorithms for Maintaining Order in a List. In: Proceedings of European Symposium on Algorithms, pp. 152-164 (2002)
6. Burrows, M., Wheeler, D.J.: A Block-sorting Lossless Data Compression Algorithm. Tech Report 124, Digital Equipment Corporation, CA, USA (1994)
7. Chan, H.L., Hon, W.K., Lam, T.W., Sadakane, K.: Compressed Indexes for Dynamic Text Collections. ACM Transactions on Algorithms 3(2) (2007)
8. Dietz, P.F., Sleator, D.D.: Two Algorithms for Maintaining Order in a List. In: Proceedings of Symposium on Theory of Computing, pp. 365-372 (1987)
9. Ferragina, P., Grossi, R.: The String B-tree: A New Data Structure for String Searching in External Memory and Its Application. Journal of the ACM 46(2), 236-280 (1999)
10. Ferragina, P., Manzini, G.: Indexing Compressed Text. Journal of the ACM 52(4), 552-581 (2005)
11. 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)
12. Hon, W.-K., Lam, T.-W., Shah, R., Tam, S.-L., Vitter, J.S.: Compressed Index for Dictionary Matching. In: DCC 2008, pp. 23-32 (2008)
13. Kärkkäinen, J., Ukkonen, E.: Sparse Suffix Trees. In: Proceedings of International Conference on Computing and Combinatorics, pp. 219-230 (1996)
14. Knuth, D.E., Morris, J.H., Pratt, V.B.: Fast Pattern Matching in Strings. SIAM Journal on Computing 6(2), 323-350 (1977)
15. Manber, U., Myers, G.: Suffix Arrays: A New Method for On-Line String Searches. SIAM Journal on Computing 22(5), 935-948 (1993)
16. McCreight, E.M.: A Space-economical Suffix Tree Construction Algorithm. Journal of the ACM 23(2), 262-272 (1976)
17. Overmars, M.H.: The Design of Dynamic Data Structures. LNCS, vol. 156. Springer, Heidelberg (1983)
18. Sadakane, K.: New text indexing functionalities of the compressed suffix arrays. Journal of Algorithms 48(2), 294-313 (2003)
19. Sadakane, K.: Compressed Suffix Trees with Full Functionality. Theory of Computing Systems, 589-607 (2007)
20. Weiner, P.: Linear Pattern Matching Algorithms. In: Proceedings of Symposium on Switching and Automata Theory, pp. 1-11 (1973)