Faster entropy-bounded compressed suffix trees

Theoretical Computer Science

Volumn 410, Issue 51, 2009, Pages 5354-5364

  Fischer, Johannes ^a   Mäkinen, Veli ^b   Navarro, Gonzalo ^c  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b UNIVERSITY OF HELSINKI   (Finland)

^c UNIVERSITY OF CHILE   (Chile)

Author keywords

Compressed data structures; Range minimum queries; Suffix trees

Indexed keywords

COMPRESSED DATA STRUCTURES; RANGE MINIMUM QUERIES; SPACE REDUCTIONS; SPACE USAGE; STRINGOLOGY; SUFFIX TREES;

BIOINFORMATICS;

DATA STRUCTURES;

EID: 70349961525     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.09.012     Document Type: Article

References (47)

1. Abouelhoda M., Kurtz S., and Ohlebusch E. Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms 2 1 (2004) 53-86
2. S. Alstrup, C. Gavoille, H. Kaplan, T. Rauhe, Nearest common ancestors: A survey and a new distributed algorithm, in: Proc. 14th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA, 2002, pp. 258-264
3. Apostolico A. The myriad virtues of subword trees. Combinatorial Algorithms on Words. NATO ISI Series. (1985), Springer-Verlag 85-96
4. Bender M., Farach-Colton M., Pemmasani G., Skiena S., and Sumazin P. Lowest common ancestors in trees and directed acyclic graphs. Journal of Algorithms 57 2 (2005) 75-94
5. Berkman O., Schieber B., and Vishkin U. Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values. Journal of Algorithms 14 3 (1993) 344-370
6. Berkman O., and Vishkin U. Recursive star-tree parallel data structure. SIAM Journal on Computing 22 2 (1993) 221-242
7. Chan H.-L., Hon W.-K., Lam T.-W., and Sadakane K. Compressed indexes for dynamic text collections. ACM Transactions on Algorithms 3 2 (2007) article 21
8. Claude F., and Navarro G. Practical rank/select queries over arbitrary sequences. Proc. 15th International Symposium on String Processing and Information Retrieval, SPIRE. LNCS vol. 5280 (2008) 176-187
9. Cole R., Kopelowitz T., and Lewenstein M. Suffix trays and suffix trists: structures for faster text indexing. Proc. 33rd International Colloquium on Automata, Languages, and Programming, ICALP. LNCS vol. 4051 (2006) 358-369
10. M. Crochemore, C. Iliopoulos, M. Kubica, M. Sohel Rahman, T. Walen, Improved algorithms for the range next value problem and applications, in: Proc. 25th Annual Symposium on Theoretical Aspects of Computer Science, STACS, 2008, pp. 205-216
11. Crochemore M., Iliopoulos C., and Sohel Rahman M. Finding patterns in given intervals. Proc. 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS. LNCS vol. 4708 (2007) 645-656
12. Delpratt O., Rahman N., and Raman R. Engineering the LOUDS succinct tree representation. Proc. 5th Workshop on Experimental Algorithmics, WEA. LNCS vol. 4007 (2006) 134-145
13. Ferragina P., González R., Navarro G., and Venturini R. Compressed text indexes: From theory to practice. ACM Journal of Experimental Algorithmics (JEA) 13 (2009) article 12
14. Ferragina P., Manzini G., Mäkinen V., and Navarro G. Compressed representations of sequences and full-text indexes. ACM Transactions on Algorithms 3 2 (2007) article 20
15. P. Ferragina, R. Venturini, A simple storage scheme for strings achieving entropy bounds, in: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 2007, pp. 690-696
16. Fischer J., and Heun V. Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE. Proc. 17th Annual Symposium on Combinatorial Pattern Matching (CPM). LNCS vol. 4009 (2006) 36-48
17. Fischer J., and Heun V. A new succinct representation of RMQ-information and improvements in the enhanced suffix array. Proc. 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE). LNCS vol. 4614 (2007) 459-470
18. J. Fischer, V. Heun, Range median of minima queries, Super-Cartesian trees, and text indexing, in: Proc. 19th International Workshop on Combinatorial Algorithms, IWOCA, 2008, pp. 239-252
19. J. Fischer, V. Heun, H. Stühler, Practical entropy-bounded schemes for O (1)-range minimum queries, in: Proc. 18th Data Compression Conference, DCC, 2008, pp. 272-281
20. Fischer J., Mäkinen V., and Navarro G. An(other) entropy-bounded compressed suffix tree. Proc. 19th Annual Symposium on Combinatorial Pattern Matching, CPM. LNCS vol. 5029 (2008) 152-165
21. Geary R., Rahman N., Raman R., and Raman V. A simple optimal representation for balanced parentheses. Theoretical Computer Science 368 (2006) 231-246
22. Golynski A. Optimal lower bounds for rank and select indexes. Proc. 33th International Colloquium on Automata, Languages and Programming, ICALP. LNCS vol. 4051 (2006) 370-381
23. González R., and Navarro G. Compressed text indexes with fast locate. Proc. 18th Annual Symposium on Combinatorial Pattern Matching, CPM. LNCS vol. 4580 (2007) 216-227
24. R. Grossi, A. Gupta, J. Vitter, High-order entropy-compressed text indexes, in: Proc. 14th ACM-SIAM Symposium on Discrete Algorithms, SODA, 2003, pp. 841-850
25. Grossi R., and Vitter J. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM Journal on Computing 35 2 (2006) 378-407
26. Gusfield D. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology (1997), Cambridge University Press
27. G. Jacobson, Space-efficient static trees and graphs, in: Proc. 30th IEEE Symposium on Foundations of Computer Science, FOCS, 1989, pp. 549-554
28. Kärkkäinen J., and Rao S. Full-text indexes in external memory. Algorithms for Memory Hierarchies. LNCS vol. 2625 (2003), Springer 149-170 (Chapter 7)
29. Kärkkäinen J., and Sanders P. Simple linear work suffix array construction. Proc. 30th International Colloquium on Automata, Languages and Programming, ICALP. LNCS vol. 2719 (2003) 943-955
30. Kasai T., Lee G., Arimura H., Arikawa S., and Park K. Linear-time longest-common-prefix computation in suffix arrays and its applications. Proc. 12th Annual Symposium on Combinatorial Pattern Matching, CPM. LNCS vol. 2089 (2001) 181-192
31. Kim D., Sim J., Park H., and Park K. Linear-time construction of suffix arrays. Proc. 14th Annual Symposium on Combinatorial Pattern Matching, CPM. LNCS vol. 2676 (2003) 186-199
32. Ko P., and Aluru S. Space efficient linear time construction of suffix arrays. Proc. 14th Annual Symposium on Combinatorial Pattern Matching, CPM. LNCS vol. 2676 (2003) 200-210
33. Ko P., and Aluru S. Optimal self-adjusting trees for dynamic string data in secondary storage. Proc. 14th International Symposium on String Processing and Information Retrieval, SPIRE. LNCS vol. 4726 (2007) 184-194
34. Kurtz S. Reducing the space requirements of suffix trees. Software: Practice and Experience 29 13 (1999) 1149-1171
35. Larsson J., and Moffat A. Off-line dictionary-based compression. Proceedings of the IEEE 88 11 (2000) 1722-1732
36. Mäkinen V., and Navarro G. Succinct suffix arrays based on run-length encoding. Nordic Journal of Computing 12 1 (2005) 40-66
37. Mäkinen V., and Navarro G. Rank and select revisited and extended. Theoretical Computer Science 387 3 (2007) 332-347
38. Manzini G. An analysis of the Burrows-Wheeler transform. Journal of the ACM 48 3 (2001) 407-430
39. Munro I. Tables. Proc. 16th Foundations of Software Technology and Theoretical Computer Science, FSTTCS. LNCS vol. 1180 (1996) 37-42
40. Munro I., Raman V., and Rao S. Space efficient suffix trees. Journal of Algorithms 39 2 (2001) 205-222
41. Navarro G., and Mäkinen V. Compressed full-text indexes. ACM Computing Surveys 39 1 (2007) article 2
42. R. Raman, V. Raman, S. Rao, Succinct indexable dictionaries with applications to encoding k-ary trees and multisets, in: Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, SODA, 2002, pp. 233-242
43. Russo L., Navarro G., and Oliveira A. Fully-compressed suffix trees. Proc. 8th Latin American Symposium on Theoretical Informatics, LATIN. LNCS vol. 4957 (2008) 362-373
44. Sadakane K. New text indexing functionalities of the compressed suffix arrays. Journal of Algorithms 48 2 (2003) 294-313
45. Sadakane K. Compressed suffix trees with full functionality. Theory of Computing Systems 41 4 (2007) 589-607
46. Sadakane K. Succinct data structures for flexible text retrieval systems. Journal Discrete Algorithms 5 1 (2007) 12-22
47. Szpankowski W. A generalized suffix tree and its (un)expected asymptotic behaviors. SIAM Journal on Computing 22 6 (1993) 1176-1198