Sciweavers

CPM
2010
Springer
209views Combinatorics» more  CPM 2010»
13 years 10 months ago
Bidirectional Search in a String with Wavelet Trees
Thomas Schnattinger, Enno Ohlebusch, Simon Gog
CPM
2010
Springer
180views Combinatorics» more  CPM 2010»
13 years 10 months ago
Algorithms for Three Versions of the Shortest Common Superstring Problem
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
Maxime Crochemore, Marek Cygan, Costas S. Iliopoul...
CPM
2010
Springer
175views Combinatorics» more  CPM 2010»
13 years 10 months ago
Compression, Indexing, and Retrieval for Massive String Data
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
CPM
2010
Springer
161views Combinatorics» more  CPM 2010»
13 years 10 months ago
Approximate All-Pairs Suffix/Prefix Overlaps
Niko Välimäki, Susana Ladra, Veli Mä...
CPM
2010
Springer
146views Combinatorics» more  CPM 2010»
13 years 10 months ago
Parallel and Distributed Compressed Indexes
Abstract. 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,...
Luís M. S. Russo, Gonzalo Navarro, Arlindo ...
Combinatorics
Top of PageReset Settings