Compressed index for dynamic text

Data Compression Conference Proceedings

Volumn , Issue , 2004, Pages 102-111

  Hon, Wing Kai ^a   Lam, Tak Wah ^a   Sadakane, Kunihiko ^b   Sung, Wing Kin ^c   Yiu, Siu Ming ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b KYUSHU UNIVERSITY   (Japan)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMPRESSION; DATA STRUCTURES; QUERY LANGUAGES; THEOREM PROVING; TREES (MATHEMATICS);

COMPRESSED SUFFIX ARRAYS (CSA); COMPRESSED SUFFIX TREES (CST); DYNAMIC TEXT;

TEXT PROCESSING;

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

References (16)

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, M. Farach, Z. Galil, R. Giancarlo, and K. Park. Dynamic Dictionary Matching. Journal of Computer and System Sciences, 49(2):208-222, 1994.
3. A. Amir, M. Farach, R. Idury, A. La Poutre, and A. Schaffer. Improved Dynamic Dictionary Matching. Information and Computation, 119(2):258-282, 1995.
4. W. I. Chang and E. L. Lawler. Sublinear Approximate String Matching and Biological Applications. Algorithmica, 12(4/5):327-344, 1994.
5. P. Ferragina and R. Grossi. Fast Incremental Text Editing. In Proceedings of Symposium on Discrete Algorithms, pages 531-540, 1995.
6. P. Ferragina and R. Grossi. Optimal On-Line Search and Sublinear Time Update in String Matching. SIAM Journal on Computing, 27(3):713-736, 1998.
7. P. Ferragina and R. Grossi. 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.
8. P. Ferragine and G. Manzini. Opportunistic Data Structures with Applications. In Proceedings of Symposium on Foundations of Computer Science, pages 390-398, 2000.
9. 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.
10. D. Gusfield, G. M. Landau, and B. Schieber. An Efficient Algorithm for All Pairs Suffix-Prefix Problem. Information Processing Letters, 41(4):181-185, 1992.
11. W. K. Hon and K. Sadakane. Space-Economical Algorithms for Finding Maximal Unique Matches. In Proceedings of Symposium on Combinatorial Pattern Matching, pages 144-152, 2002.
12. W. K. Hon, K. Sadakane, and W. K. Sung. Breaking a Time-and-Sapce Barrier in Constructing Full-Text Indices. In Proceedings of Symposium on Foundations of Computer Science, pages 251-260, 2003.
13. U. Manber and G. Myers. Suffix Arrays: A New Method for On-Line String Searches. SIAM Journal on Computing, 22(5):935-948, 1993.
14. E. M. McCreight. A Space-economical Suffix Tree Construction Algorithm. Journal of the ACM, 23(2):262-272, 1976.
15. K. Sadakane. Compressed Suffix Tree with Full Functionality. Manuscript, 2003.
16. 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.