Compressed indexes for dynamic text collections

ACM Transactions on Algorithms

Volumn 3, Issue 2, 2007, Pages

  Chan, Ho Leung ^a   Hon, Wing Kai ^b   Lam, Tak Wah ^a   Sadakane, Kunihiko ^c  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^c KYUSHU UNIVERSITY   (Japan)

Author keywords

Compressed suffix tree; String matching

Indexed keywords

COMPRESSED SUFFIX TREE; DICTIONARY MATCHING; LIBRARY MANAGEMENT; STATIC TEXTS; STRING MATCHING;

DATA COMPRESSION; DIGITAL LIBRARIES; GLOSSARIES; INFORMATION MANAGEMENT; PATTERN MATCHING; TEXT PROCESSING;

INDEXING (OF INFORMATION);

EID: 34250206975     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1240233.1240244     Document Type: Article

References (32)

1. AHO, A., AND CORASICK, M. 1975. Efficient string matching: An aid to bibliographic search. Commun. ACM 18, 6, 333-340.
2. AMIR, A., AND FARACH, M. 1991. Adaptive dictionary matching. In Proceedings of the Symposium on Foundations of Computer Science. 760-766.
3. AMIR, A., FARACH, M., GALIL, Z., GIANCARLO, R., AND PARK, K. 1994. Dynamic dictionary matching. J. Comput. Syst. Sci. 49, 2, 208-222.
4. AMIR, A., FARACH, M., IDURY, R., POUTRE, A. L., AND SCHAFFER, A. 1995. Improved dynamic dictionary matching. Inf. Comput. 119, 2, 258-282.
5. AMIR, A., FARACH, M., AND MATIAS, Y. 1992. Efficient randomized dictionary matching algorithms (extended abstract). In Proceedings of the Symposium on Combinatorial Pattern Matching. 262-275.
6. BURROWS, M., AND WHEELER, D. J. 1994. A block-sorting lossless data compression algorithm. Tech. Rep. 124, Digital Equipment Corporation, Paolo Alto, California.
7. ELIAS, P. 1975. Universal codeword sets and representation of the integers. IEEE Trans. Inf. Theory 21, 2, 194-203.
8. FERRAGINA, P., AND MANZINI, G. 2000. Opportunistic data structures with applications. In Proceedings of the Symposium on Foundations of Computer Science. 390-398.
9. FERRAGINA, P., AND MANZINI, G. 2005. Indexing compressed text. J. ACM 52, 4, 552-581.
10. FERRAGINA, P., MANZINI, G., MÄKINEN, V., AND NAVARRO, G. 2004. An alphabet-friendly FM-index. In Proceedings of the International Symposium on String Processing and Information Retrieval. 150-160.
11. FREDMAN, M. L., AND SAKS, M. E. 1989. The cell probe complexity of dynamic data structures. In Proceedings of the Symposium on Theory of Computing. 345-354.
12. GROSSI, R., GUPTA, A., AND VITTER, J. S. 2003. High-order entropy-compressed text indexes. In Proceedings of the Symposium on Discrete Algorithms. 841-850.
13. GROSSI, R., GUPTA, A., AND VITTER, J. S. 2004. When indexing equals compression: Experiments with compressing suffix arrays and applications. In Proceedings of the Symposium on Discrete Algorithms. 636-645.
14. GROSSI, R., AND VITTER, J. S. 2000. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In Proceedings of the Symposium on Theory of Computing. 397-406.
15. GROSSI, R., AND VITTER, J. S. 2005. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM J. Comput. 35, 2, 378-407.
16. HON, W. K., LAM, T. W., SUNG, W. K., TSE, W. L., WONG, C. K., AND YIU, S. M. 2004. Practical aspects of compressed suffix arrays and FM-index in searching DNA sequences. In Proceedings of the Workshop on Algorithm Engineering and Experiments. 31-38.
17. JACOBSON, G. 1989. Space-Efficient static trees and graphs. In Proceedings of the Symposium on Foundations of Computer Science. 549-554.
18. KURTZ, S. 1999. Reducing the space requirement of suffix trees. Softw. Pract. Experien. 29, 1149-1171.
19. LAM, T. W., SADAKANE, K., SUNG, W. K., AND YIU, S. M. 2002. A space and time efficient algorithm for constructing compressed suffix arrays. In Proceedings of the International Conference on Computing and Combinatorics. 401-410.
20. MÄKINEN, V., AND NAVARRO, G. 2004. Run-Length FM-index. In Proceedings of the DIMACS Workshop: The Burrows-Wheeler Transform: Ten Years Later. 17-19.
21. MANBER, U., AND MYERS, G. 1993. Suffix arrays: A new method for on-line string searches. SIAM J. Comput. 22, 5, 935-948.
22. MCCREIGHT, E. M. 1976. A space-economical suffix tree construction algorithm. J. ACM 23, 2, 262-272.
23. MEWES, H. W., AND HEUMANN, K. 1995. Genome analysis: Pattern search in biological macromolecules. In Proceedings of the Symposium on Combinatorial Pattern Matching. 261-285.
24. MUNRO, J. I., AND RAMAN, V. 2001. Succinct representation of balanced parentheses and static trees. SIAM J. Comput. 31, 3, 762-776.
25. OVERMARS, M. H. 1983. The design of dynamic data structures. Lecture Notes in Computer Science, vol. 156.
26. RAMAN, R., RAMAN, V., AND RAO, S. S. 2001. Succinct dynamic data structures. In Proceedings of the Workshop on Algorithms and Data Structures. 426-437.
27. SADAKANE, K. 2000. Compressed text databases with efficient query algorithms based on compressed suffix array. In Proceedings of the International Symposium on Algorithms and Computation. 410-421.
28. SADAKANE, K. 2002. Succinct representations of lcp information and improvements in the compressed suffix arrays. In Proceedings of the Symposium on Discrete Algorithms. 225-232.
29. SADAKANE, K. 2007. Compressed suffix trees with full functionality. Theor. Comput. Syst. to appear.
30. SAHINALP, S. C., AND VISHKIN, U. 1996. Efficient approximate and dynamic matching of patterns using a labeling paradigm. In Proceedings of the Symposium on Foundations of Computer Science. 320-328.
31. WEINER, P. 1973. Linear pattern matching algorithms. In Proceedings of the Symposium on Switching and Automata Theory. 1-11.
32. YAO, A. C. 1981. Should tables be sorted? j. ACM 28, 3, 615-628.