loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2007 Data Compression Conference (DCC'07)
Snowbird, Utah
March 27-March 29
ISBN: 0-7695-2791-4
ASCII Text
x 
 
Ge Nong, Sen Zhang, "An Efficient Algorithm For The Inverse ST Problem," Data Compression Conference, pp. 397, 2007 Data Compression Conference (DCC'07), 2007.
 
 
BibTex
x
 
@article{ 10.1109/DCC.2007.11,
author = {Ge Nong and Sen Zhang},
title = {An Efficient Algorithm For The Inverse ST Problem},
journal ={Data Compression Conference},
volume = {0},
year = {2007},
issn = {1068-0314},
pages = {397},
doi = {http://doi.ieeecomputersociety.org/10.1109/DCC.2007.11},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Compression Conference
TI - An Efficient Algorithm For The Inverse ST Problem
SN - 1068-0314
SP
EP
A1 - Ge Nong,
A1 - Sen Zhang,
PY - 2007
KW - null
VL - 0
JA - Data Compression Conference
ER -
 
Ge Nong, Sun Yat-Sen University, PRC
Sen Zhang, SUNY College at Oneonta, USA
The Schindler Transform (ST) [1] can speed up the block sorting phase of the Burrows- Wheeler Transform (BWT) by limiting the context sorting to the first k (k ?? [0,N], where N is the length of the text) positions only. Under the ST?fs partial sorting scheme, if two rows share the exactly same k-order context, they may not be ordered alphabetically; instead, the relative order between them in the original matrix is preserved in the transformed matrix.
Citation:
Ge Nong, Sen Zhang, "An Efficient Algorithm For The Inverse ST Problem," dcc, pp.397, 2007 Data Compression Conference (DCC'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.