Sciweavers

CPM
2010
Springer
145views Combinatorics» more  CPM 2010»
12 years 11 months ago
Succinct Representations of Separable Graphs
Abstract. We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In p...
Guy E. Blelloch, Arash Farzan
CPM
2010
Springer
120views Combinatorics» more  CPM 2010»
13 years 9 months ago
Pseudo-realtime Pattern Matching: Closing the Gap
Raphaël Clifford, Benjamin Sach
CPM
2010
Springer
119views Combinatorics» more  CPM 2010»
13 years 9 months ago
Phylogeny- and Parsimony-Based Haplotype Inference with Constraints
Michael Elberfeld, Till Tantau
CPM
2010
Springer
114views Combinatorics» more  CPM 2010»
13 years 9 months ago
Small-Space 2D Compressed Dictionary Matching
Shoshana Neuburger, Dina Sokol
CPM
2010
Springer
144views Combinatorics» more  CPM 2010»
13 years 9 months ago
Breakpoint Distance and PQ-Trees
Haitao Jiang, Cedric Chauve, Binhai Zhu
CPM
2010
Springer
146views Combinatorics» more  CPM 2010»
13 years 9 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 ...
CPM
2010
Springer
124views Combinatorics» more  CPM 2010»
13 years 9 months ago
Succinct Dictionary Matching with No Slowdown
Djamal Belazzougui
CPM
2010
Springer
209views Combinatorics» more  CPM 2010»
13 years 9 months ago
Bidirectional Search in a String with Wavelet Trees
Thomas Schnattinger, Enno Ohlebusch, Simon Gog