Dynamic dictionary matching and compressed suffix trees

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 13-22

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

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA STRUCTURES; PATTERN RECOGNITION; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS);

DICTIONARY MATCHING; DYNAMIC DATA STRUCTURES; GENERALIZATION; STATIC TREES; TIME COMPLEXITY;

GLOSSARIES;

EID: 20744440148     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. A. Aho and M. Corasick. Efficient String Matching: An Aid to Bibliographic Search. Communications of the ACM, 18(6):333-340, 1975.
2. A. Amir and M. Farach. Adaptive Dictionary Matching. In Proceedings of Symposium on Foundations of Computer Science, pages 760-766, 1991.
3. A. Amir, M. Farach, Z. Galil, R. Giancarlo, and K. Park. Dynamic Dictionary Matching. Journal of Computer and System Sciences, 49(2):208-222, 1994.
4. A. Amir, M. Farach, R. Idury, A. La Poutre, and A. Schaffer. Improved Dynamic Dictionary Matching. Information and Computation, 119(2):258-282, 1995.
5. A. Amir, M. Farach, and Y. Matias. Efficient Randomized Dictionary Matching Algorithms (Extended Abstract). In Proceedings of Symposium on Combinatorial Pattern Matching, pages 262-275, 1992.
6. M. Burrows and D. J. Wheeler. A Block-sorting Lossless Data Compression Algorithm. Technical Report 124, Digital Equipment Corporation, Paolo Alto, California, 1994.
7. H. L. Chan, W. K. Hon, and T. W. Lam. Compressed Index for a Dynamic Collection of Texts. In Proceedings of Symposium on Combinatorial Pattern Matching, pages 445-456, 2004.
8. W. I. Chang and E. L. Lawler. Sublinear Approximate String Matching and Biological Applications. Algorithmica, 12(4/5):327-344, 1994.
9. A. L. Delcher, S. Kasif, R. D. Fleischmann, J. Peterson, O. White, and S. L. Salzberg. Alignment of whole genomes. Nucleic Acids Research, 27(11):2369-2376, 1999.
10. P. Ferragina and G. Manzini. Opportunistic Data Structures with Applications. In Proceedings of Symposium on Foundations of Computer Science, pages 390-398, 2000.
11. M. L. Fredman and M. E. Saks. The Cell Probe Complexity of Dynamic Data Structures. In Proceedings of Symposium on Theory of Computing, pages 345-354, 1989.
12. R. Grossi and G. F. Italiano. Suffix Trees and their Applications in String Algorithms. In Proceedings of South American Workshop on String Processing, pages 57-76, 1993.
13. R. Grossi and J. S. Vitter. Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. In Proceedings of Symposium on Theory of Computing, pages 397-406, 2000.
14. R. Grossi, A. Gupta and J. S. Vitter. When Indexing Equals Compression: Experiments with Compressing Suffix Arrays and Applications. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms, pages 636-645, 2004.
15. D. Gusfield. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York, 1997.
16. G. Jacobson. Space-efficient Static Trees and Graphs. In Proceedings of Symposium on Foundations of Computer Science, pages 549-554, 1989.
17. U. Manber and G. Myers. Suffix Arrays: A New Method for On-Line String Searches. SIAM Journal on Computing, 22(5):935-948, 1993.
18. E. M. McCreight. A Space-economical Suffix Tree Construction Algorithm. Journal of the ACM, 23(2):262-272, 1976.
19. J. I. Munro and V. Raman. Succinct Representation of Balanced Parentheses and Static Trees. SIAM Journal on Computing, 31(3):762-776, 2001.
20. R. Raman, V. Raman, and S. S. Rao. Succinct Dynamic Data Structures. In Proceedings of Workshop on Algorithms and Data Structures, pages 426-437, 2001.
21. K. Sadakane. Succinct representations of lcp information and improvements in the compressed suffix arrays. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms, pages 225-232, 2002.
22. K. Sadakane. Compressed Suffix Trees with Full Functionality. Theory of Computing Systems, accepted.
23. S. C. Sahinalp and U. Vishkin. Efficient Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm. In Proceedings of Symposium on Foundations of Computer Science, pages 320-328, 1996.
24. P. Weiner. Linear Pattern Matching Algorithms. In Proceedings of Symposium on Switching and Automata Theory, pages 1-11, 1973.