10 search results - page 1 / 2 » A Linear-Time Burrows-Wheeler Transform Using Induced Sortin... |
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 ...
CORR
2012
Springer
12 years 1 days ago
2012
Springer
Given a string of characters, the Burrows-Wheeler Transform rearranges the characters in it so as to produce another string of the same length which is more amenable to compressio...
SODA
2004
ACM
13 years 5 months ago
2004
ACM
VLDB
2007
ACM
14 years 4 months ago
2007
ACM
RadixZip is a block compression technique for token streams. It introduces RadixZip Transform, a linear time algorithm that rearranges bytes using a technique inspired by radix so...
DCC
1998
IEEE
13 years 8 months ago
1998
IEEE
Abstract. The Burrows-Wheeler transform (BWT) and block sorting compression are closely related to the context trees of PPM. The usual approach of treating BWT as merely a permutat...