269 search results - page 1 / 54 » Computing the inverse sort transform in linear time |
TALG
2011
13 years 7 days ago
2011
CORR
2012
Springer
12 years 1 months 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...
CPM
2008
Springer
13 years 7 months ago
2008
Springer
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
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 ...
STOC
1995
ACM
13 years 8 months ago
1995
ACM
Genomes frequently evolve by reversals (i, j) that transform a gene order 1 . . . iiϩ1 . . . jϪ1j . . . n into 1 . . . ijϪ1 . . . iϩ1j . . ....