#### Filter Results:

- Full text PDF available (81)

#### Publication Year

1968

2017

- This year (4)
- Last 5 years (43)
- Last 10 years (70)

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter
- SODA
- 2003

We present a novel implementation of compressed suffix arrays exhibiting new tradeoffs between search time and space occupancy for a given text (or sequence) of <i>n</i> symbols over an alphabet σ, where each symbol is encoded by lg|σ| bits. We show that compressed suffix arrays use just nH<inf>h</inf> + σ bits, while… (More)

- Roberto Grossi, Jeffrey Scott Vitter
- SIAM J. Comput.
- 2000

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 f?r P in T quickly, with T being fully scanned only once, nafiaely, when the… (More)

- Paolo Ferragina, Roberto Grossi
- J. ACM
- 1999

We introduce a new text-indexing data structure, the <italic>String B-Tree</italic>, that can be seen as a link between some traditional external-memory and string-matching data structures. In a short phrase, it is a combination of B-trees and Patricia tries for internal-node indices that is made more effective by adding extra pointers to speed up search… (More)

- Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter
- SODA
- 2004

We report on a new and improved version of high-order entropy-compressed suffix arrays, which has theoretical performance guarantees similar to those in our earlier work [16], yet represents an improvement in practice. Our experiments indicate that the resulting text index offers state-of-the-art compression. In particular, we require roughly 20% of the… (More)

- Roberto Grossi, Giuseppe Ottaviano
- ACM Journal of Experimental Algorithmics
- 2012

Tries are popular data structures for storing a set of strings, where common prefixes are represented by common root-to-node paths. More than 50 years of usage have produced many variants and implementations to overcome some of their limitations. We explore new succinct representations of path-decomposed tries and experimentally evaluate the corresponding… (More)

- Kunihiko Sadakane, Roberto Grossi
- SODA
- 2006

Consider a sequence <i>S</i> of <i>n</i> symbols drawn from an alphabet <i>A</i> = {1, 2,. . .,σ}, stored as a binary string of <i>n</i>log σ bits. A <i>succinct</i> data structure on <i>S</i> supports a given set of primitive operations on <i>S</i> using just <i>f (n)</i> = <i>o</i>(<i>n</i> log σ) extra bits. We present a technique for… (More)

- Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao
- STACS
- 2009

We consider the problem of representing, in a compressed format, a bit-vector S of m bits with n 1s, supporting the following operations, where b ∈ {0, 1}: • rank b (S, i) returns the number of occurrences of bit b in the prefix S [1..i]; • select b (S, i) returns the position of the ith occurrence of bit b in S. Such a data structure is called fully… (More)

- Roberto Grossi, Giuseppe Ottaviano
- SEA
- 2013

We describe a set of basic succinct data structures which have been implemented as part of the Succinct library, and applications on top of the library: an index to speed-up the access to collections of semi-structured data, a compressed string dictionary, and a compressed dictionary for scored strings which supports top-k prefix matching.

- Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot
- IEEE/ACM Transactions on Computational Biology…
- 2005

Motif inference represents one of the most important areas of research in computational biology, and one of its oldest ones. Despite this, the problem remains very much open in the sense that no existing definition is fully satisfying, either in formal terms, or in relation to the biological questions that involve finding such motifs. Two main types of… (More)