A quick tour on suffix arrays and compressed suffix arrays

Theoretical Computer Science

Volumn 412, Issue 27, 2011, Pages 2964-2973

  Grossi, Roberto ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Data compression; Implicitness and succinctness; Pattern matching; Space efficiency; Suffix array; Suffix tree; Text indexing

Indexed keywords

IMPLICITNESS AND SUCCINCTNESS; SPACE EFFICIENCY; SUFFIX ARRAY; SUFFIX TREE; TEXT INDEXING;

DATA STRUCTURES; ENCODING (SYMBOLS); INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; PATTERN MATCHING; PLANT EXTRACTS; TREES (MATHEMATICS);

DATA COMPRESSION;

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

References (54)

1. E.M. McCreight A space-economical suffix tree construction algorithm Journal of the ACM 23 2 1976 262 272
2. P. Weiner, Linear pattern matching algorithm, in: Proc. 14th IEEE Symposium on Switching and Automata Theory, 1973, pp. 111.
3. G.H. Gonnet, PAT 3.1 An efficient text searching system. User's Manual, UW Centre for the New OED, University of Waterloo, Canada, 1987.
4. A. Apostolico, C. Iliopoulos, G.M. Landau, B. Schieber, and U. Vishkin Parallel construction of a suffix tree with applications Algorithmica 3 1988 347 365 (Pubitemid 18620773)
5. G.M. Landau, Personal communication, CPM09, 2009.
6. U. Manber, and G. Myers Suffix arrays: a new method for on-line string searches SIAM Journal on Computing 22 5 1993 935 948
7. J. Krkkinen, P. Sanders, and S. Burkhardt Linear work suffix array construction Journal of the ACM 53 6 2006 918 936 (Pubitemid 46276961)
8. P. Ko, and S. Aluru Space efficient linear time construction of suffix arrays Journal of Discrete Algorithms 3 24 2005 143 156 (Pubitemid 40655175)
9. D.K. Kim, J.S. Sim, H. Park, and K. Park Linear-time construction of suffix arrays R.A. Baeza-Yates, E. Chvez, M. Crochemore, Combinatorial Pattern Matching, 14th Annual Symposium, CPM 2003, Morelia, Michocn, Mexico, June 2527, 2003, Proceedings Lecture Notes in Computer Science vol. 2676 2003 Springer 186 199 (Pubitemid 36769862)
10. S.J. Puglisi, W.F. Smyth, and A.H. Turpin A taxonomy of suffix array construction algorithms ACM Computer Survey 39 2 2007 4
11. D.E. Knuth, J.H. Morris, and V.R. Pratt Fast pattern matching in strings SIAM Journal on Computing 6 1977 323 350
12. E. Ukkonen On-line construction of suffix trees Algorithmica 14 3 1995 249 260
13. P. Ferragina, and R. Grossi The String B-tree: a new data structure for string search in external memory and its applications Journal of the ACM 46 2 1999 236 280
14. M.A. Bender, M. Farach-Colton, and B.C. Kuszmaul Cache-oblivious string B-trees ACM Proc. of the 25th ACM SIGMOD-SIGACT-SIGART Symp. on Principles of Database Systems Chicago, IL, USA June 2628, 2006 2006 ACM Press 233 242 (Pubitemid 46946485)
15. D.E. Knuth Sorting and Searching 2nd ed. The Art of Computer Programming vol. 3 1998 Addison-Wesley Reading, MA, USA
16. D.S. Hirschberg On the complexity of searching a set of vectors SIAM Journal on Computing 9 1 1980 126 129
17. A. Andersson, T. Hagerup, J. Hstad, and O. Petersson Tight bounds for searching a sorted array of strings SIAM Journal on Computing 30 5 2000 1552 1578 (Pubitemid 33099789)
18. 2n ) time Journal of Computer and System Sciences 33 1 1986 66 74 (Pubitemid 17484839)
19. T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park Linear-time longest-common-prefix computation in suffix arrays and its applications A. Amir, G.M. Landau, Combinatorial Pattern Matching, 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 14, 2001, Proceedings Lecture Notes in Computer Science vol. 2089 2001 Springer 181 192 (Pubitemid 33298873)
20. M.A. Bender, and M. Farach-Colton The LCA problem revisited Lecture Notes in Computer Science 2000 88 94
21. B. Schieber, and U. Vishkin On finding lowest common ancestors: simplification and parallelization SIAM Journal on Computing 17 6 1988 1253 1262
22. A. Amir, J. Fischer, and M. Lewenstein Two-dimensional range minimum queries B. Ma, K. Zhang, Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching CPM'07, Ontario, July 911, 2007 Lecture Notes in Computer Science vol. 4580 2007 Springer-Verlag London 286 294
23. G. Franceschini, and R. Grossi No sorting? better searching! ACM Transactions on Algorithms 4 1 2008 2:12:18
24. H. Bannai, S. Inenaga, A. Shinohara, and M. Takeda Inferring strings from graphs and arrays B. Rovan, P. Vojts, Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 2529, 2003, Proceedings Lecture Notes in Computer Science vol. 2747 2003 Springer 208 217
25. S. Burkhardt, and J. Krkkinen Fast lightweight suffix array construction and checking R.A. Baeza-Yates, E. Chvez, M. Crochemore, Combinatorial Pattern Matching, 14th Annual Symposium, CPM 2003, Morelia, Michocn, Mexico, June 2527, 2003, Proceedings Lecture Notes in Computer Science vol. 2676 2003 Springer 55 69
26. M. Crochemore, J. Dsarmnien, and D. Perrin A note on the BurrowsWheeler transformation Theoretical Informatics and Applications 332 13 2005 567 572
27. J.-P. Duval, and A. Lefebvre Words over an ordered alphabet and suffix permutations Theoretical Informatics and Applications 36 3 2002 249 259
28. M. He, J.I. Munro, and S.S. Rao A categorization theorem on suffix arrays with applications to space efficient text indexes Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms 2005 SIAM 23 32 (Pubitemid 40851354)
29. C. Hohlweg, and C. Reutenauer Lyndon words, permutations and trees Theoretical Computer Science 307 1 2003 173 178
30. T. Kopelowitz, M. Lewenstein, Personal communication, CPM09, 2009.
31. K.-B. Schrmann, and J. Stoye Counting suffix arrays and strings Theor. Comput. Sci. 395 23 2008 220 234
32. 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 2005
33. R.L. Graham, D.E. Knuth, and O. Patashnik Concrete Mathematics 1994 Addison-Wesley Reading, Massachusetts
34. M. Burrows, D.J. Wheeler, A block-sorting lossless data compression algorithm, Research Report 124, Digital SRC, Palo Alto, CA, USA, May 1994.
35. A. Brodnik, and J. Munro Membership in constant time and almost-minimum space SIAM Journal on Computing 28 1999 1627 1640 (Pubitemid 129304145)
36. J.I. Munro Tables FSTTCS: Foundations of Software Technology and Theoretical Computer Science 16 1996 37 42
37. R. Pagh Low redundancy in static dictionaries with constant query time SIAM Journal on Computing 31 2001 353 363 (Pubitemid 33782954)
38. R. Raman, V. Raman, and S.S. Rao Succinct indexable dictionaries, with applications to representing k-ary trees, prefix sums and multisets ACM Transactions on Algorithms 3 4 2007
39. R. Grossi, A. Gupta, and J.S. Vitter High-order entropy-compressed text indexes Proceedings of the Thitheenth Annual ACM-SIAM Symposium on Discrete Algorithms 2003 ACM/SIAM 841 850
40. P. Ferragina, R. Giancarlo, and G. Manzini The myriad virtues of wavelet trees Information and Computation 207 8 2009 849 866
41. A. Amir, G. Benson, M. Farach, Let sleeping files lie: pattern matching in Z-compressed files, in: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, Virginia, 1994, pp. 705714.
42. J. Krkkinen, and E. Ukkonen Sparse suffix trees Lecture Notes in Computer Science 1090 1996 219 230 (Pubitemid 126090097)
43. J. Krkkinen, and E. Ukkonen Lempel-Ziv parsing and sublinear-size index structures for string matching N. Ziviani, R. Baeza-Yates, K. Guimares, Proceedings of the 3rd South American Workshop on String Processing 1996 Carleton University Press Recife, Brazil 141 155
44. G. Navarro, and V. Mkinen Compressed full-text indexes ACM Computing Surveys 39 1 2007 2:12:61
45. W.-K. Hon, K. Sadakane, W.-K. Sung, Breaking a time-and-space barrier in constructing full-text indices, in: IEEE (Ed.), Proceedings: 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003, 1114 October 2003, Cambridge, Massachusetts, 2003, pp. 251260.
46. G. Nong, S. Zhang, Optimal lightweight construction of suffix arrays for constant alphabets, in: WADS, 2007, pp. 613624.
47. P. Ferragina, and G. Manzini Indexing compressed text Journal of the ACM 52 4 2005 552 581 (Pubitemid 43078371)
48. P. Ferragina, G. Manzini, V. Mkinen, and G. Navarro Compressed representations of sequences and full-text indexes ACM Transactions on Algorithms 3 2 2007
49. K. Sadakane New text indexing functionalities of the compressed suffix arrays Journal of Algorithms 48 2 2003 294 313
50. A. Brodnik, and J.I. Munro Membership in constant time and almost-minimum space SIAM Journal on Computing 28 5 1999 1627 1640 (Pubitemid 129304145)
51. R. Raman, V. Raman, and S.R. Satti Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets ACM Transactions on Algorithms 3 4 2007 1 43
52. D. Adjeroh, T. Bell, and A. Mukherjee The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching 2008 Springer-Verlag
53. W.-K. Hon, R. Shah, J.S. Vitter, Compression, indexing, and retrieval for massive string data, in: CPM, 2010, pp. 260274.
54. P. Ferragina, Data structures: Time, I/Os, entropy, joules!, in: ESA (2), 2010, pp. 116.