SPIRE
2009
Springer
13 years 11 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 ...
SPIRE
2009
Springer
13 years 11 months ago
2009
Springer
We introduce two new index structures based on the q-gram index. The new structures index substrings of variable length instead of q-grams of fixed length. For both of the new ind...
SPIRE
2009
Springer
13 years 11 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
2009
Springer
13 years 11 months ago
2009
Springer
The directed graph representation of the World Wide Web has been extensively used to analyze the Web structure, behavior and evolution. However, those graphs are huge and do not ...