CPM
15 years 6 months ago
2010 Springer
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...
115
click to vote
CPM
15 years 6 months ago
2010 Springer
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...
CPM
15 years 6 months ago
2010 Springer 111
click to vote
CPM
15 years 6 months ago
2010 Springer
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,...
|