#### Filter Results:

- Full text PDF available (54)

#### Publication Year

2000

2019

- This year (8)
- Last 5 years (62)
- Last 10 years (91)

#### Supplemental Content

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Gonzalo Navarro, Veli Mäkinen
- ACM Comput. Surv.
- 2007

Full-text indexes provide fast substring search over large text collections. A serious problem of these indexes has traditionally been their space consumption. A recent trend is to develop indexes… (More)

- Paolo Ferragina, Giovanni Manzini, Veli Mäkinen, Gonzalo Navarro
- ACM Trans. Algorithms
- 2007

Given a sequence <i>S</i> = <i>s</i><sub>1</sub><i>s</i><sub>2</sub>…<i>s</i><sub><i>n</i></sub> of integers smaller than <i>r</i> = <i>O</i>(polylog(<i>n</i>)), we show how <i>S</i> can be… (More)

- Veli Mäkinen, Gonzalo Navarro
- CPM
- 2005

A succinet full-text self-index is a data structure built on a text T = t1t2...tn, which takes little space (ideally close to that of the compressed text), permits efficient search for the… (More)

- Veli Mäkinen, Gonzalo Navarro, Jouni Sirén, Niko Välimäki
- Journal of Computational Biology
- 2010

A repetitive sequence collection is a set of sequences which are small variations of each other. A prominent example are genome sequences of individuals of the same or close species, where the… (More)

- Veli Mäkinen, Gonzalo Navarro
- CPM
- 2006

Given a sequence of n bits with binary zero-order entropy H0, we present a dynamic data structure that requires nH0 + o(n) bits of space, which is able of performing rank and select, as well as… (More)

- Veli Mäkinen, Gonzalo Navarro
- Theor. Comput. Sci.
- 2007

The deep connection between the Burrows-Wheeler transform (BWT) and the so-called rank and select data structures for symbol sequences is the basis of most successful approaches to compressed text… (More)

- Johannes Fischer, Veli Mäkinen, Gonzalo Navarro
- Theor. Comput. Sci.
- 2009

Suffix trees are among the most important data structures in stringology, with a number of applications in flourishing areas like bioinformatics. Their main problem is space usage, which has… (More)

Research on succinct data structures has made significant progress in recent years. An essential building block of many of those techniques is a data structure to perform rank and select operations… (More)

- Niko Välimäki, Veli Mäkinen
- CPM
- 2007

We study the Document Listing problem, where a collection D of documents d1,..., dk of total length Σi di = n is to be preprocessed, so that one can later efficiently list all the ndoc documents… (More)

- Veli Mäkinen, Gonzalo Navarro
- SPIRE
- 2007

Compression boosting (Ferragina & Manzini, SODA 2004) is a new technique to enhance zeroth order entropy compressors' performance to k-th order entropy. It works by constructing the Burrows-Wheeler… (More)