Roberto Grossi, Jeffrey Scott Vitter  Home/Search
Context Related
| di.unipi.it/pub/Papers/g...stoc00.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: di.unipi.it/~grossi/RESE...select (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The proliferation of online text, such as on the World Wide Web and in databases, motivates the need for space-efficient index methods that support fast search. Consider a text T of n binary symbols to index. Given any query pattern P of m binary symbols, the goal is to search for P in T quickly, with T being fully scanned only once, namely, when the index is created. All indexing schemes published in the last thirty years support searching in \Theta(m) worst-case time and require \Theta(n)... (Update)
Similar documents based on text: More All
0.6: Succinct Representations of lcp Information and Improvements in.. - Sadakane (2002) (Correct)
0.4: Opportunistic Data Structures with Applications - Ferragina, Manzini (2000) (Correct)
0.3: Space Efficient Suffix Trees - Munro, Raman, Rao (1998) (Correct)
BibTeX entry: (Update)
R. Grossi and J. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In Proceedings of the 32nd ACM Symposium on Theory of Computing, 2000. http://citeseer.ist.psu.edu/grossi00compressed.html More
@inproceedings{ grossi00compressed,
author = "Roberto Grossi and Jeffrey Scott Vitter",
title = "Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)",
pages = "397--406",
year = "2000",
url = "citeseer.ist.psu.edu/grossi00compressed.html" }
Citations (may not include all citations):347 Fast pattern matching in strings (context) - Knuth, Morris et al. - 1977
204 Oxford University Press (context) - Crochemore, Rytter - 1994
172 A space-economical suffix tree construction algorithm (context) - McCreight - 1976
148 Storing a sparse table with O (context) - Fredman, Koml'os et al. - 1984
118 GLIMPSE: A tool to search through entire file systems - Manber, Wu - 1994
112 Suffix arrays: a new method for on-line string searches (context) - Manber, Myers - 1993
78 PATRICIA - Practical Algorithm To Retrieve Information Coded.. (context) - Morrison - 1968
76 line construction of suffix trees - Ukkonen - 1995
62 Trees and Sequences: Computer Science and Computational Biol.. (context) - Gusfield, Strings - 1997
55 The smallest automaton recognizing the subwords of a text (context) - Blumer, Blumer et al. - 1985
47 New indices for text: PAT trees and PAT arrays (context) - Gonnet, Baeza-Yates et al. - 1992
46 Succinct representation of balanced parentheses - Munro, Raman - 1997
43 Department of Computer Science (context) - Clark, trees - 1996
40 Time-space-optimal string matching (context) - Galil, Seiferas - 1983
36 Self-indexing inverted files for fast text retrieval - Moffat, Zobel - 1996
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC