110
Voted
SPIRE
15 years 7 months ago
2009 Springer 
To compute Burrows-Wheeler Transform (BWT), one usually builds a suffix array (SA) first, and then obtains BWT using SA, which requires much redundant working space. In previous ...
122
click to vote
SPIRE
15 years 7 months ago
2009 Springer
Abstract. This paper presents a user study that evaluated the effectiveness of an aggregated search interface in the context of non-navigational search tasks. An experimental syst...
87
Voted
SPIRE
15 years 7 months ago
2009 Springer
We introduce a symbol reordering technique that implicitly synchronizes variable-length codes, such that it is possible to directly access the i-th codeword without need of any sam...
SPIRE
15 years 7 months ago
2009 Springer 
The consensus string problem is finding a representative string (consensus) of a given set S of strings. In this paper we deal with the consensus string problems optimizing both d...
100
Voted
SPIRE
15 years 7 months ago
2009 Springer
A new trend in the field of pattern matching is to design indexing data structures which take space very close to that required by the indexed text (in entropy-compressed form) an...
|
Information Technology