Compressed property suffix trees

Data Compression Conference Proceedings

Volumn , Issue , 2011, Pages 123-132

  Hon, Wing Kai ^a   Patil, Manish ^b   Shah, Rahul ^b   Thankachan, Sharma V ^b  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b Louisiana State University   (United States)

Author keywords

Compressed Indexes; Pattern Matching; Property Matching; Suffix Tree

Indexed keywords

ALPHABET SIZE; COMPRESSED INDEXES; COMPRESSED SUFFIX ARRAY; LINEAR TIME; PREPROCESS; PROPERTY MATCHING; QUERY ANSWERING; SPACE REQUIREMENTS; SUFFIX ARRAYS; SUFFIX-TREES;

INDEXING (OF INFORMATION); PATTERN MATCHING;

DATA COMPRESSION;

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

References (19)

1. A. Amir, E. Chencinski, C. S. Iliopoulos, T. Kopelowitz, and H. Zhang. Property Matching and Weighted Matching. Theoretical Computer Science, 395(2-3):298-310, 2008.
2. D. R. Clark and J. I. Munro. Efficient Suffix Trees on Secondary Storage. Proceedings of SODA, pages 383-391, 1996.
3. P. Ferragina and G. Manzini. Indexing Compressed Text. Journal of the ACM, 52(4):552-581, 2005. (Pubitemid 43078371)
4. P. Ferragina, G. Manzini, V. M̈akinen, and G. Navarro. Compressed Representations of Sequences and Full-Text Indexes. ACM Transactions on Algorithms, 3(2), 2007.
5. J. Fischer. Optimal Succinctness for Range Minimum Queries. Proceedings of LATIN, pages 158-169, 2010.
6. R. Grossi, A. Gupta, and J. S. Vitter. High-Order Entropy-Compressed Text Indexes. Proceedings of SODA, pages 841-850, 2003.
7. 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.
8. C. S. Iliopoulos and M. S. Rahman. Faster Index for Property Matching. Information Processing Letters, 105(6):218-223, 2008.
9. M. T. Juan, J. J. Liu, and Y. L. Wang. Errata for "Faster Index for Property Matching". Information Processing Letters, 109(18):1027-1029, 2009.
10. J. Jurka. Origin and Evolution of Alu Repetitive Elements. The Impact of Short Interspersed Elements (SINEs) on the Host Genome, pages 25-41, 1995.
11. J. Jurka. Human Repetitive Elements. Molecular Biology and Biotechnology, pages 438-441, 1995.
12. T. Kopelowitz. The Property Suffix Tree with Dynamic Properties. Proceedings of CPM, pages 63-75, 2010.
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. G. Navarro and V. M̈akinen. Compressed Full-Text Indexes. ACM Computing Surveys, 39(1), 2007.
15. R. Raman, V. Raman, and S. S. Rao. Succinct Dynamic Data Structures. Proceedings of WADS, pages 426-437, 2001. (Pubitemid 33315667)
16. R. Raman, V. Raman, and S. S. Rao. Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees, Prefix Sums and Multisets. ACM Transactions on Algorithms, 3(4), 2007.
17. K. Sadakane. New Text Indexing Functionalities of the Compressed Suffix Arrays. Journal of Algorithms 48(2), pages 294-313, 2003.
18. K. Sadakane. Compressed Suffix Trees with Full Functionality. Theoretical Computer Science, pages 589-607, 2007.
19. P. Weiner. Linear Pattern Matching Algorithms. In Proceedings of Switching and Automata Theory, pages 1-11, 1973.