Roberto Grossi
- 1.A. Amir, D. Keselman, G. M. Landau, M. Lewenstein, N. Lewenstein, and M. Rodeh. Indexing and dictionary matching with one error. Lecture Notes in Computer Science, 1663:181-190, 1999.]] Google Scholar
Digital Library
- 2.A. Andersson, N. J. Larsson, and K. Swanson. Suffix trees on words. Algorithmica, 23(3):246-260, 1999.]]Google ScholarCross Ref
- 3.A. Andersson and S. Nilsson. Efficient implementation of suffix trees. Software Practice and Experience, 25(2):129-141, Feb. 1995.]] Google ScholarDigital Library
- 4.A. Apostolico. The myriad virtues of suffix trees. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, volume 12 of NATO Advanced Scieace Institutes, Series F, pages 85-96, Springer-Verlag, berlin, 1985.]]Google Scholar
- 5.A. Apostolico, C. Iliopoulos, G. M. Landau, B. Schieber, and U. Vishkin. Parallel construction of a suffix tree with applications. Algorithmica, 3:347-365, 1988.]]Google ScholarDigital Library
- 6.J. L. Bentley and H. A. Maurer. Efficient worst-case data structures for range searching. Acta Informatica, 13:155-168, 1980.]]Google ScholarDigital Library
- 7.A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. Chen, and J. Seiferas. The smallest automaton recognizing the subwords of a text. Theoretical Computer Science, 40(1):31-55, Sept. 1985.]]Google ScholarCross Ref
- 8.A. Blumer, J. Blumer, D. Haussler, R. McConnei1, and A. Ehrenfeucht. Complete inverted files for efficient text retrieval and analysis. Journal of the A CM, 34(3):578- 595, July 1987.]] Google ScholarDigital Library
- 9.G. S. Brodal and L. G$sieniec. Approximate dictionary queries. In D. S. Hirschberg and E. W. Myers, editors, Proc. 7th Annual Syrup. Combinatorial Pattern Matching, CPM, volume 1075 of Lecture Notes in Computer Science, LNCS, pages 65-74, Springer-Verlag, 10- 12 June 1996.]] Google ScholarDigital Library
- 10.D. Clark. Compact Pat trees. PhD Thesis, Department of Computer Science, University of Waterloo, 1996.]] Google ScholarDigital Library
- 11.D. R. Clark and J. I. Munro. Efficient suffix trees on secondary storage (extended abstract). In Proceedings of the Seventh Annual A CM-SIAM Symposium on Discrete Algorithms, pages 383-391, Atlanta, Georgia, 28- 30 Jan. 1996.]] Google ScholarDigital Library
- 12.L. Colussi and A. De Col. A time and space efficient data structure for string searching on large texts. Information Processing Letters, 58(5):217-222, Oct. 1996.]]Google ScholarCross Ref
- 13.M. Crochemore. Transducers and repetitions. Theoretical Computer Science, 45(1):63-86, 1986.]] Google ScholarDigital Library
- 14.M. Crochemore and D. Perrin. Two-way string matching. Journal of the Association for Computing Machincry, 38:651-675, 1991.]] Google ScholarDigital Library
- 15.M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, 1994.]] Google ScholarDigital Library
- 16.M. Farach. Optimal suffix tree construction with large alphabets. In 38th Annual Symposium on Foundations of Computer Science, pages 137-143, Miami Beach, Florida, 20-22 Oct. 1997. IEEE.]] Google ScholarDigital Library
- 17.M. Farach, P. Ferragina, and S. Muthukrishnan. Overcoming the memory bottleneck in suffix tree construction. in IEEE Symposium on Foundations on Computer Science (to appear in J.A CM), 1998.]] Google ScholarDigital Library
- 18.M. Farach and S. Muthukrishnan. Optimal logarithmic time randomized suffix tree construction. In F. M. auf der Heide and B. Monien, editors, Automata, Languages and Programming, 23rd International Colloquium, volume 1099 of Lecture Notes in Computer Science, pages 550-561, Paderborn, Germany, 8-12 July 1996, Springer-Verlag.]] Google ScholarDigital Library
- 19.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 A CM, 46(2):236-280, Max. 1999.]] Google ScholarDigital Library
- 20.P. Ferragina and G. Manzini. Personal communication, 2OOO.]]Google Scholar
- 21.M. L. Fredlnan, J. Koml6s, and E. Szemer~di. Storing a sparse table with O(1) worst case access time. Journal of the Association for Computing Machinery, 31(3):538-544, July 1984.]] Google ScholarDigital Library
- 22.Z. Galil and J. Seiferas. Time-space-optimal string matching. Journal of Computer and System Sciences, 26:280-294, 1983.]]Google ScholarCross Ref
- 23.R. Giegerich, S. Kurtz, and J. Stoye. Efficient implementation of lazy suffix trees. In J. S. Vitter and C. D. Zaroliagis, editors, Proceedings of the 3rd Workshop on Algorithm Engineering, number 1668 in Lecture Notes in Computer Science, pages 30-42, London, UK, 1999, Springer-Verlag, Berlin.]] Google ScholarDigital Library
- 24.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, chapter 5, pages 66-82. Prentice-Hall, 1992.]] Google ScholarDigital Library
- 25.D. Gusfield. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.]] Google ScholarDigital Library
- 26.R. W. Irving. Suffix binary search trees. Technical Report TR-1995-7, Computing Science Department, University of Glasgow, 1995.]]Google Scholar
- 27.G. Jacobson. Space-efficient static trees and graphs. In IEEE Symposium on Foundations of Computer Science, pages 549-554, 1989.]]Google ScholarDigital Library
- 28.G. Jacobson. Succinct static data structures. Technical Report CMU-CS-89-112, Dept. of Computer Science, Carnegie-Mellon University, Jan. 1989.]]Google Scholar
- 29.J. KSrkk~inen. Suffix cactus: A cross between suffix tree and suffix array. In Combinatorial Pattern Matching, volume 937 of Lecture Notes in Computer Science, pages 191-204. Springer, 1995.]]Google ScholarCross Ref
- 30.J. K~rkk~inen and E. Sutinen. Lempel-Ziv index for q-grams. Algorithmica, 21(1):137-154, 1998.]]Google ScholarCross Ref
- 31.J. K&rkk//inen and E. Ukkonen. Lempel-Ziv parsing and sublinear-size index structures for string matching. In N. Ziviani, R. Baeza-Yates, and K. Guimar&es, editors, Proceedings of the 3rd South American Workshop on String Processing, pages 141-155, Recife, Brazil, 1996. Carleton University Press.]]Google Scholar
- 32.J. K&rkk&inen and E. Ukkonen. Sparse suffix trees. Lecture Notes in Computer Science, 1090:219-230, 1996.]] Google ScholarDigital Library
- 33.D. E. Knuth, J. H. Morris, and V. R. Pratt. Fast pattern matching in strings. SIAM Journal on Computing, 6:323-350, 1977.]]Google ScholarDigital Library
- 34.S. Kurtz. Reducing the space requirement of suffix trees. Technical Report 98-03, Universit/~t Bielefeld, 1998.]]Google Scholar
- 35.U. Manber and G. Myers. Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing, 22(5):935-948, 1993.]] Google ScholarDigital Library
- 36.U. Manber and S. Wu. GLIMPSE: A tool to search through entire file systems. In Proceedings of the USENIX Winter 199~ Technical Conference, pages 23- 32, 1994.]] Google ScholarDigital Library
- 37.E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the A CM, 23(2):262- 272, 1976.]] Google ScholarDigital Library
- 38.A. Moffat and J. Zobel. Self-indexing inverted files for fast text retrieval. A CM Transactions on Information Systems, 14(4):349-379, Oct. 1996.]] Google ScholarDigital Library
- 39.D. R. Morrison. PATRICIA- Practical Algorithm To Retrieve Information Coded In Alphanumeric. Journal of the ACM, 15(4):514-534, Oct. 1968.]] Google ScholarDigital Library
- 40.J. i. Munro. Tables. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, 16:37- 42, 1996.]] Google ScholarDigital Library
- 41.J. I. Munro and V. Raman. Succinct representation of balanced parentheses, static trees and planar graphs. In 38th Annual Symposium on Foundations of Computer Science, pages 118-126, 1997.]] Google ScholarDigital Library
- 42.J. I. Munro, ~V. Raman, and S. Srinivasa Rao. Space efiqcient suffix trees. In Proceedings of Foundations of Software Technology and Theoretical Computer Science, volume 1530 of Lecture Notes in Computer Science, pages 186-195, Berlin, Germany, 1998, Springer-Verlag.]] Google ScholarDigital Library
- 43.M. H. Overmars. Efficient data structures for range searching on a grid. Journal of Algorithms, 9(2):254- 275, June 1988.]] Google ScholarDigital Library
- 44.S. C. Sahinalp and U. Vishkin. Symmetry breaking for suffix tree construction. In Proceedings of the 26th Annual Symposium on the Theory of Computing, pages 300-309, New York, May 1994, ACM Press.]] Google ScholarDigital Library
- 45.E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3):249-260, Sept. 1995.]]Google ScholarDigital Library
- 46.P. Weiner. Linear pattern matching algorithm. Proc. l~th IEEE Symposium on Switching and Automata Theory, pages 1-11, 1973.]]Google ScholarDigital Library
- 47.D. E. Willard. On the application of sheared retrieval to orthogonal range queries. In Proceedings of the Second Annual Symposium on Computational Geometry, pages 80-89, 1986.]] Google ScholarDigital Library
- 48.A. C. Yao and F. F. Yao. Dictionary look-up with small errors. Lecture Notes in Computer Science, 937:387- 394, 1995.]]Google ScholarCross Ref
- 49.J. Zobel, A. Moffat, and K. Ramamohanarao. Inverted files versus signature files for text indexing. A CM Transactions on Database Systems, 23(4):453-490, Dec. 1998.]] Google ScholarDigital Library
Index Terms
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
Recommendations
New text indexing functionalities of the compressed suffix arrays
New text indexing functionalities of the compressed suffix arrays are proposed. The compressed suffix array proposed by Grossi and Vitter is a space-efficient data structure for text indexing. It occupies only O(n) bits for a text of length η; however ...
Approximate string matching using compressed suffix arrays
Let T be a text of length n and P be a pattern of length m, both strings over a fixed finite alphabet A. The k-difference (k-mismatch, respectively) problem is to find all occurrences of P in T that have edit distance (Hamming distance, respectively) at ...
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
The proliferation of online text, such as found on the World Wide Web and in online databases, motivates the need for space-efficient text indexing methods that support fast string searching. We model this scenario as follows: Consider a text $T$ ...
Comments