Paolo Ferragina, Giovanni Manzini  Home/Search
Context Related
| mfn.unipmn.it/~manzin...focs00draft.pdf 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: mfn.unipmn.it/~manzini/fm...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponential increase of electronic data nowadays available which is even surpassing the significant increase in memory and disk storage capacities of current computers. Space reduction is an attractive issue because it is also intimately related to performance improvements as noted by several authors (e.g. Knuth [15],... (Update)
Cited by: More
Rapid Homology Search with Two-Stage Extension and Daughter Seeds - Ma (2005) (Correct)
Suffix Arrays: What Are They Good for? - Puglisi, Smyth, al. (2006) (Correct)
Rapid Homology Search with Neighbor Seeds - Csürös, Ma (2005) (Correct)
Similar documents (at the sentence level):
36.9%: Opportunistic Data Structures with Applications - Ferragina, Manzini (2000) (Correct)
Active bibliography (related documents): More All
1.1: On Compressing and Indexing Data - Ferragina, Manzini (Correct)
0.5: Indexing Compressed Text - He (2003) (Correct)
0.5: Fast and Compact Volume Rendering in the - Compressed Transform Domain (Correct)
Similar documents based on text: More All
0.4: An Alphabet-Friendly FM-index - Ferragina, Manzini, Mäkinen, Navarro (Correct)
0.3: Two space saving tricks for linear time LCP computation - Manzini (2004) (Correct)
0.3: Compression Boosting in Optimal Linear Time Using the.. - Ferragina, Manzini (2004) (Correct)
Related documents from co-citation: More All
15: An experimental study of an opportunistic index - Ferragina, Manzini - 2001
15: Compressed text databases with ecient query algorithms based on the compressed s.. (context) - Sadakane - 2000
15: A block-sorting lossless data compression algorithm - Burrows, Wheeler - 1994
BibTeX entry: (Update)
P. Ferragina and G. Manzini. Opportunistic Data Structures with Applications. Technical Report TR00-03, Dipartimento di Informatica, Universita di Pisa, March 2000. http://citeseer.ist.psu.edu/ferragina00opportunistic.html More
@inproceedings{ ferragina00opportunistic,
author = "Paolo Ferragina and Giovanni Manzini",
title = "Opportunistic Data Structures with Applications",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "390-398",
year = "2000",
url = "citeseer.ist.psu.edu/ferragina00opportunistic.html" }
Citations (may not include all citations):280 Managing Gigabytes: Compressing and Indexing Documents and I.. - Witten, Mo et al. - 1999
250 volume 3 of The Art of Computer Programming (context) - Knuth, Searching - 1998
143 A block sorting lossless data compression algorithm - Burrows, Wheeler - 1994
118 GLIMPSE: A tool to search through entire file systems - Manber, Wu - 1994
78 Programming Pearls (context) - Bentley - 1989
73 A space-economical su#x tree construction algorithm (context) - McCreight - 1976
61 agrep - A fast approximate pattern-matching tool - Wu, Manber - 1992
61 Let sleeping files lie: Pattern matching in Z-compressed fil.. - Amir, Benson et al. - 1996
45 String matching in Lempel-Ziv compressed strings - Farach, Thorup - 1998
34 arrays: a new method for on-line string searches (context) - Manber, Myers - 1993
28 tree: A new data structure for string search in external mem.. (context) - Ferragina, Grossi et al. - 1999
27 Optimal prediction for prefetching in the worst case - Vitter - 1998
24 Adding compression to block addressing inverted indexes - Navarro, de Moura et al.
19 Worst-case optimal insertion and deletion methods for decomp.. (context) - Overmars, van Leeuwen - 1981
13 cient two-dimensional compressed matching (context) - Amir, Benson - 1992
13 Lempel-Ziv parsing and sublinear-size index structures for s.. - Karkkainen, Ukkonen - 1996
12 An analysis of the Burrows-Wheeler transform - Manzini - 1999
12 arrays and su#x trees with applications to text indexing and.. (context) - Grossi, Vitter - 2000
10 Optimal dynamization of decomposable searching problems (context) - Mehlhorn, Overmars - 1981
8 Sorting and searching revisited (context) - Andersson - 1996
6 A locally adaptive compression scheme (context) - Bentley, Sleator et al. - 1986
6 Block addressing indices for approximate text retrieval (context) - Baeza-Yates, Navarro - 2000
5 Succinct data structures (context) - Munro - 1999
4 A modified Burrows-Wheeler transformation for case-insensiti.. - Sadakane - 1999
3 extended abstract (context) - Karlin, Phillips et al. - 1992
2 Lempel-Zip index for q-grams (context) - Karkkainen, Sutinen - 1996
2 culty of prediction to decrease computation: Fast sort (context) - Chen, Reif - 1993
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