Compressed index for dictionary matching

Data Compression Conference Proceedings

Volumn , Issue , 2008, Pages 23-32

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

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b LOUISIANA STATE UNIVERSITY   (United States)

^c UNIVERSITY OF HONG KONG   (Hong Kong)

^d PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; MICROWAVE ANTENNAS; PATTERN MATCHING;

DICTIONARY MATCHING; SPACE COMPLEXITIES;

DATA COMPRESSION;

EID: 50249188924     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2008.62     Document Type: Conference Paper

References (19)

1. A. Aho and M. Corasick. Efficient String Matching: An Aid to Bibliographic Search. Communications of the ACM, 18(6):333-340, 1975.
2. S. Alstrup, T. Husfeldt, and T. Rauhe. Marked Ancestor Problems. Technical Report RS-98-16, Basic Research in Computer Science (BRICS), 1998. Extended abstract appears in FOCS'98, pages 534-543.
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. H. L. Chan, W. K. Hon, T. W. Lam, and K. Sadakane. Compressed Indexes for Dynamic Text Collections. ACM Transactions on Algorithms, 3(2), 2007.
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 G. Manzini. Indexing Compressed Text. Journal of the ACM, 52(4):552-581, 2005. A preliminary version appears in FOCS'00.
8. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro. Compressed Representations of Sequences and Full-Text Indexes. ACM Transactions on Algorithms, 3(2), 2007.
9. P. Ferragina and R. Venturini. A simple storage scheme for strings achieving entropy bounds. In Proceedings of Symposium on Discrete Algorithms, pages 690-696, 2007.
10. R. Grossi, A. Gupta, and J. S. Vitter. High-Order Entropy-Compressed Text Indexes. In Proceedings of Symposium on Discrete Algorithms, pages 841-850, 2003.
11. R. Grossi and J. S. Vitter. Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. SIAM Journal on Computing, 35(2):378-407, 2005. A preliminary version appears in STOC'00.
12. T. Hagerup, P. B. Miltersen, and R. Pagh. Deterministic Dictionaries. Journal on Algorithms, 41(1):69-85, 2001.
13. W. K. Hon, T. W. Lam, W. K. Sung, W. L. Tse, C. K. Wong, and S. M. Yiu. Practical Aspects of Compressed Suffix Arrays and FM-index in Searching DNA Sequences. In Proceedings of Workshop on Algorithm Engineering and Experiments, pages 31-38, 2004.
14. E. M. McCreight. A Space-economical Suffix Tree Construction Algorithm. Journal of the ACM, 23(2):262-272, 1976.
15. G. Navarro and V. Mäkinen. Compressed Full-Text Indexes. ACM Computing Surveys, 39(1), 2007.
16. K. Sadakane. New text indexing functionalities of the compressed suffix arrays. Journal of Algorithms, 48(2):294-313, 2003. A preliminary version appears in ISAAC 2000.
17. 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.
18. P. Weiner. Linear Pattern Matching Algorithms. In Proceedings of Symposium on Switching and Automata Theory, pages 1-11, 1973.
19. D. E. Willard. Log-Logarithmic Worst-Case Range Queries are Possible in Space ⊖(N). Information Processing Letters, 17(2):81-84, 1983.