#### Filter Results:

#### Publication Year

2005

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Suffix trees are by far the most important data structure in stringology, with a myriad of applications in fields like bioinformatics and information retrieval. Classical representations of suffix trees require Θ(<i>n</i> log <i>n</i>) bits of space, for a string of size <i>n</i>. This is considerably more than the <i>n</i> log<sub>2</sub> σ… (More)

We consider various data-analysis queries on two-dimensional points. We give new space/time tradeoffs over previous work on geometric queries such as dominance and rectangle visibility, and on semigroup and group queries such as sum, average, variance, minimum and maximum. We also introduce new solutions to queries less frequently considered in the… (More)

A compressed full-text self-index for a text T , of size u, is a data structure used to search patterns P , of size m, in T that requires reduced space, i.e. that depends on the empirical entropy (H k , H0) of T , and is, furthermore, able to reproduce any substring of T. In this paper we present a new compressed self-index able to locate the occurrences of… (More)

Suffix trees are by far the most important data structure in stringology, with myriads of applications in fields like bioinformatics, data compression and information retrieval. Classical representations of suffix trees require O(n log n) bits of space, for a string of size n. This is considerably more than the n log 2 σ bits needed for the string itself,… (More)

We study parallel and distributed compressed indexes. Compressed indexes are a new and functional way to index text strings. They exploit the compressibility of the text, so that their size is a function of the compressed text size. Moreover, they support a considerable amount of functions, more than many classical indexes. We make use of this extended… (More)

—We present a new algorithm to calculate exact hy-pervolumes. Given a set of d-dimensional points, it computes the hypervolume of the dominated space. Determining this value is an important subroutine of Multiobjective Evolutionary Algorithms (MOEAs). We analyze the " Quick Hypervolume " (QHV) algorithm theoretically and experimentally. The theoretical… (More)

RePair is a dictionary-based compression method invented in 1999 by Lars-son and Moffat. Although its practical performance has been established through experiments, the method has resisted all attempts of formal analysis. In this paper we show that RePair compresses a sequence T [1, n] over an alphabet of size σ and k-th order entropy H k , to at most 2H k… (More)

A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can reproduce any substring of T , thus it actually replaces T. Despite the explosion of interest on self-indexes in recent years, there has not been much progress on search functionali-ties beyond… (More)

Indexing methods for the approximate string matching problem spend a considerable effort generating condensed neighborhoods. Here, we point out that condensed neighborhoods are not a minimal representation of a pattern neighborhood. We show that we can restrict our attention to super condensed neighborhoods which are minimal. We then present an algorithm… (More)