Compressed suffix arrays and suffix trees with applications to text indexing and string matching

SIAM Journal on Computing

Volumn 35, Issue 2, 2006, Pages 378-407

  Grossi, Roberto ^a   Vitter, Jeffrey Scott ^b  

^a UNIVERSITY OF PISA   (Italy)

^b Purdue University   (United States)

Author keywords

Compressed data structures; Compression; Pattern matching; String searching; Suffix arrays; Suffix trees; Text indexing; Text retrieval

Indexed keywords

COMPRESSED DATA STRUCTURES; SUFFIX ARRAYS; TEXT INDEXING; TEXT RETRIEVAL;

DATA COMPRESSION; DATA STRUCTURES; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; PATTERN MATCHING; TEXT PROCESSING;

TREES (MATHEMATICS);

EID: 33645796213     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702402354     Document Type: Article

References (72)

1. S. ALSTRUP, G. S. BRODAL, AND T. RAUHE, New data structures for orthogonal range searching, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000, pp.198-207.
2. A. AMIR AND G. BENSON, Efficient two-dimensional compressed matching, in Proceedings of the IEEE Data Compression Conference, J. A. Storer and M. Cohn, eds., IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 279-288.
3. A. AMIR, G. BENSON, AND M. FARACH, Let sleeping files LIE: Pattern matching in Z-compressed files, J. Comput. System Sci., 52 (1996), pp. 299-307.
4. A. AMIR, D. KESELMAN, G. M. LANDAU, M. LEWENSTEIN, N. LEWENSTEIN, AND M. RODEH, Text indexing and dictionary matching with one error, J. Algorithms, 37 (2000), pp. 309-325.
5. A. ANDERSSON, N. J. LARSSON, AND K. SWANSON, Suffix trees on words, Algorithmica, 23 (1999), pp. 246-260.
6. A. ANDERSSON AND S. NILSSON, Efficient implementation of suffix trees, Software Practice and Experience, 25 (1995), pp. 129-141.
7. A. APOSTOLICO, The myriad virtues of suffix trees, in Combinatorial Algorithms on Words, A. Apostolico and Z. Galil, eds., NATO Advanced Science Institutes Series F: Computer and System Sciences 12, Springer-Verlag, Berlin, 1985, pp. 85-96.
8. A. APOSTOLICO, C. ILIOPOULOS, G. M. LANDAU, B. SCHIEBER, AND U. VISHKIN, Parallel construction of a suffix tree with applications., Algorithmica, 3 (1988), pp. 347-365.
9. J. L. BENTLEY AND H. A. MAURER, Efficient worst-case data structures for range searching, Acta Inform., 13 (1980), pp. 155-168.
10. A. BLUMER, J. BLUMER, D. HAUSSLER, A. EHRENFEUCHT, M. T. CHEN, AND J. SEIFERAS, The smallest automation recognizing the subwords of a text, Theoret. Comput. Sci., 40 (1985), pp. 31-55.
11. A. BLUMER, J. BLUMER, D. HAUSSLER, R. MCCONNELL, AND A. EHRENFEUCHT, Complete inverted files for efficient text retrieval and analysis, J. ACM, 34 (1987), pp. 578-595.
12. G. S. BRODAL AND L. GA̧SIENIEC, Approximate dictionary queries, in Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching, D. S. Hirschberg and E. W. Myers, eds., Lecture Notes in Comput. Sci. 1075, Springer-Verlag, Berlin, New York, 1996, pp. 65-74.
13. A. BRODNIK AND J. I. MUNRO, Membership in constant time and almost-minimum space, SIAM J. Comput., 28 (1999), pp. 1627-1640.
14. M. BURROWS AND D. J. WHEELER, A Block Sorting Data Compression Algorithm, Tech. report, Digital Systems Research Center, Palo Alto, CA, 1994.
15. D. CLARK, Compact Pat Trees, Ph.D. thesis, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, 1996.
16. D. R. CLARK AND J. I. MUNRO, Efficient suffix trees on secondary storage (extended abstract), in Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1996, pp. 383-391.
17. L. COLUSSI AND A. DE COL, A time and space efficient data structure for string searching on large texts, Inform. Process. Lett., 58 (1996), pp. 217-222.
18. M. CROCHEMORE, Transducers and repetitions, Theoret. Comput. Sci., 45 (1986), pp. 63-86.
19. M. CROCHEMORE AND D. PERRIN, Two-way string matching, J. ACM, 38 (1991), pp. 651-675.
20. M. CROCHEMORE AND W. RYTTER, Text Algorithms, Oxford University Press, Oxford, UK, 1994.
21. E. S. DE MOURA, G. NAVARRO, AND N. ZIVIANI, Indexing compressed text, in Proceedings of the South American Workshop on String Processing, Carleton University Press, Ottawa, Ontario, Canada, 1997, pp. 95-111.
22. E. D. DEMAINE AND A. LÓPEZ-ORTIZ, A linear lower bound on index size for text retrieval, in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2001, pp. 289-294.
23. P. ELIAS, Efficient storage and retrieval by content and address of static files, J. ACM, 21 (1974), pp. 246-260.
24. M. FARACH AND M. THORUP, String matching in Lempel-Ziv compressed strings, Algorithmica, 20 (1998), pp. 388-404.
25. M. FARACH-COLTON, Optimal suffix tree construction with large alphabets, in Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, Miami Beach, FL, 1997, pp. 137-143.
26. M. FARACH-COLTON, P. FERRAGINA, AND S. MUTHUKRISHNAN, On the sorting-complexity of suffix tree construction, J. ACM, 47 (2000), pp. 987-1011.
27. M. FARACH-COLTON AND S. MUTHUKRISHNAN, Optimal logarithmic time randomized suffix tree construction, in Automata, Languages, and Programming, 23rd International Colloquium, F. Meyer auf der Heide and B. Monien, eds., Lecture Notes in Comput. Sci. 1099, Springer-Verlag, Berlin, New York, 1996, pp. 550-561.
28. P. FERRAGINA AND R. GROSSI, The String B-tree: a new data structure for string search in external memory and its applications, J. ACM, 46 (1999), pp. 236-280.
29. P. FERRAGINA AND G. MANZINI, Opportunistic data structures with applications, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000, pp. 390-398.
30. P. FERRAGINA AND G. MANZINI, An experimental study of an opportunistic index, in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2001, pp. 269-278.
31. M. L. FREDMAN, J. KOMLÓS, AND E. SZEMERÉDI, Storing a sparse table with O(1) worst case access time, J. ACM, 31 (1984), pp. 538-544.
32. A. GÁL AND P. B. MILTERSEN, Automata, Languages and Programming, in Proceedings of the 30th International Colloquium, Lecture Notes in Comput. Sci. 2719, Springer, Berlin, New York, 2003, pp. 332-344.
33. Z. GALIL AND J. SEIFERAS, Time-space-optimal string matching, J. Comput. System Sci., 26 (1983), pp. 280-294.
34. R. GIEGERICH, S. KURTZ, AND J. STOYE, Efficient implementation of lazy suffix trees, in Proceedings of the 3rd Workshop on Algorithm Engineering, J. S. Vitter and C. D. Zaroliagis, eds., Lecture Notes in Comput. Sci. 1668, Springer-Verlag, Berlin, 1999, pp. 30-42.
35. G. H. GONNET, R. A. BAEZA-YATES, AND T. SNIDER, New indices for text: PAT trees and PAT arrays, in Information Retrieval: Data Structures And Algorithms, Prentice-Hall, Englewood Cliffs, NJ, 1992, pp. 66-82.
36. R. GROSSI, A. GUPTA, AND J. S. VITTER, High-order entropy-compressed text indexes, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2003, pp. 841-850.
37. R. GROSSI AND J. S. VITTER, Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract), in Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing, Portland, OR, 2000, pp. 397-406.
38. D. GUSFIELD, Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology, Cambridge University Press, Cambridge, UK, 1997.
39. T. HAGERUP, P. B. MILTERSEN, AND R. PAGH, Deterministic dictionaries, J. Algorithms, 41 (2001), pp. 69-85.
40. W.-K. HON, K. SADAKANE, AND W.-K. SUNG, Breaking a time-and-space barrier in constructing full-text indices, in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2003, pp. 251-260.
41. R. W. IRVING, Suffix Binary Search Trees, Tech. report TR-1995-7, Computing Science Department, University of Glasgow, Glasgow, UK, 1995.
42. G. JACOBSON, Space-efficient static trees and graphs, in Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, 1989, pp. 549-554.
43. G. JACOBSON, Succinct Static Data Structures, Tech. report CMU-CS-89-112, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA, 1989.
44. J. KÄRKKÄINEN, Suffix cactus: A cross between suffix tree and suffix array, in Combinatorial Pattern Matching, Lecture Notes in Comput. Sci. 937, Springer, Berlin, New York, 1995, pp. 191-204.
45. J. KÄRKKÄINEN AND E. SUTINEN, Lempel-Ziv index for q-grams, Algorithmica, 21 (1998), pp. 137-154.
46. J. KÄRKKÄINEN AND E. UKKONEN, Lempel-Ziv parsing and sublinear-size index structures for string matching, in Proceedings of the 3rd South American Workshop on String Processing, N. Ziviani, R. Baeza-Yates, and K. Guimarães, eds., Carleton University Press, Ottawa, Ontario, Canada, 1996, pp. 141-155.
47. J. KÄRKKÄINEN AND E. UKKONEN, Sparse suffix trees, in Computing and Combinatorics, Lecture Notes in Comput. Sci. 1090, Springer, Berlin, 1996, pp. 219-230.
48. D. E. KNUTH, Sorting and Searching, 2nd ed., The Art of Computer Programming 3, Addison-Wesley, Reading, MA, 1998.
49. D. E. KNUTH, J. H. MORRIS, JR., AND V. R. PRATT, Fast pattern matching in strings, SIAM J. Comput., 6 (1977), pp. 323-350.
50. S. R. KOSARAJU, Real-time pattern matching and quasi-real-time construction of suffix tree, in Proceedings of the 26th ACM Symposium on the Theory of Computing, ACM, New York, pp. 310-316.
51. S. R. KOSARAJU AND A. L. DELCHER, Large-scale assembly of DNA strings and space-efficient construction of suffix trees, in Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, Las Vegas, NV, 1995, pp. 169-177.
52. S. R. KOSARAJU AND A. L. DELCHER, Correction: Large-scale assembly of DNA strings and space-efficient construction of suffix trees, in Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, Philadelphia, PA, 1996, p. 659.
53. S. KURTZ, Reducing the Space Requirement of Suffix Trees, Software Practice and Experience, 29 (1999), pp. 1149-1171.
54. V. MÄKINEN, Compact suffix array, in Combinatorial Pattern Matching, Lecture Notes in Comput. Sci. 1848, Springer, Berlin, New York, 2000, pp. 305-319.
55. U. MANBER AND G. MYERS, Suffix arrays: A new method for on-line string searches, SIAM J. Comput., 22 (1993), pp. 935-948.
56. U. MANBER AND S. WU, GLIMPSE: A tool to search through entire file systems, in Proceedings of the USENIX Winter 1994 Technical Conference, 1994, pp. 23-32.
57. E. M. MCCREIGHT, A space-economical suffix tree construction algorithm, J. ACM, 23 (1976), pp. 262-272.
58. A. MOFFAT AND J. ZOBEL, Self-indexing inverted files for fast text retrieval, ACM Trans. Inform. Systems, 14 (1996), pp. 349-379.
59. D. R. MORRISON, PATRICIA - Practical algorithm to retrieve information coded In alphanumeric, J. ACM, 15 (1968), pp. 514-534.
60. J. I. MUNRO, Tables, in Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Comput. Sci. 1180, Springer, Berlin, pp. 37-42.
61. J. I. MUNRO AND V. RAMAN, Succinct representation of balanced parentheses, static trees and planar graphs, in Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, 1997, pp. 118-126.
62. J. I. MUNRO, V. RAMAN, AND S. S. RAO, Space efficient suffix trees, J. Algorithms. 39 (2001), pp. 205-222.
63. R. PAGH, Low redundancy in static dictionaries with constant query time, SIAM J. Comput., 31 (2001), pp. 353-363.
64. K. SADAKANE, Compressed text databases with efficient query algorithms based on the compressed suffix array, in Proceedings of ISAAC '00, Lecture Notes in Comput. Sci. 1969, Springer, Berlin, New York, 2000, pp. 410-421.
65. K. SADAKANE, Succinct representations of lcp information and improvements in the compressed suffix arrays, in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2002, pp. 225-232.
66. S. C. SAHINALP AND U. VISHKIN, Symmetry breaking for suffix tree construction, in Proceedings of the 26th Annual Symposium on the Theory of Computing, ACM, 1994, pp. 300-309.
67. E. UKKONEN, On-line construction of suffix trees, Algorithmica, 14 (1995), pp. 249-260.
68. P. WEINER, Linear pattern matching algorithm, in Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory, 1973, pp. 1-11.
69. D. E. WILLARD, On the application of sheared retrieval to orthogonal range queries, in Proceedings of the Second Annual Symposium on Computational Geometry, ACM, New York, 1986, pp. 80-89.
70. A. C. YAO AND F. F. YAO, Dictionary look-up with one error, J. Algorithms, 25 (1997), pp. 194-202.
71. N. ZIVIANI, E. S. DE MOURA, G. NAVARRO, AND R. BAEZA-YATES, Compression: A key for next-generation text retrieval systems, IEEE Comput., 33 (2000), pp. 37-44.
72. J. ZOBEL, A. MOFFAT, AND K. RAMAMOHANARAO, Inverted files versus signature files for text indexing, ACM Trans. Database Systems, 23 (1998), pp. 453-490.