
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ge Nong, Sen Zhang, "Efficient Algorithms for the Inverse Sort Transform," IEEE Transactions on Computers, vol. 56, no. 11, pp. 15641574, November, 2007.  
BibTex  x  
@article{ 10.1109/TC.2007.70762, author = {Ge Nong and Sen Zhang}, title = {Efficient Algorithms for the Inverse Sort Transform}, journal ={IEEE Transactions on Computers}, volume = {56}, number = {11}, issn = {00189340}, year = {2007}, pages = {15641574}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2007.70762}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Efficient Algorithms for the Inverse Sort Transform IS  11 SN  00189340 SP1564 EP1574 EPD  15641574 A1  Ge Nong, A1  Sen Zhang, PY  2007 KW  BurrowsWheeler transform KW  inverse sort transform KW  limitorder contexts KW  algorithm design KW  data compression. VL  56 JA  IEEE Transactions on Computers ER   
[1] M. Burrows and D.J. Wheeler, “A BlockSorting Lossless Data Compression Algorithm,” SRC Research Report 124, Digital Systems Research Center, Calif., May 1994.
[2] D. Adjeroh et al., “DNA Sequence Compression Using the BurrowsWheeler Transform,” Proc. IEEE CS Bioinformatics Conf., pp. 303313, Aug. 2002.
[3] Z. Arnavut, “Lossless and NearLossless Compression of ECG Signals,” Proc. 23rd Ann. Int'l Conf. IEEE Eng. in Medicine and Biology Soc., vol. 3, pp. 21462149, Oct. 2001.
[4] A. Mukherjee et al., “Prototyping of Efficient Hardware Algorithms for Data Compression in Future Communication Systems,” Proc. 12th Int'l Workshop Rapid System Prototyping (RSP '01), pp. 5863, June 2001.
[5] M. Schindler and B. Sebastian, “Image Compression Using Blocksort,” Proc. Data Compression Conf. (DCC '01), p. 515, Mar. 2001.
[6] Z. Arnavut, “Lossless Compression of ColorMapped Images,” Optical Eng., vol. 38, no. 6, pp. 10011005, June 1999.
[7] B. Balkenhol and S. Kurtz, “Universal Data Compression Based on the BurrowsWheeler Transformation: Theory and Practice,” IEEE Trans. Computers, vol. 49, no. 10, pp. 10431053, Oct. 2000.
[8] B. Balkenhol, S. Kurtz, and Y.M. Shtarkov, “Modifications of the Burrows and Wheeler Data Compression Algorithm,” Proc. Data Compression Conf. (DCC '99), pp. 188197, Mar. 1999.
[9] G. Manzini, “The BurrowsWheeler Transform: Theory and Practice,” Proc. 24th Int'l Symp. Math. Foundations of Computer Science (MFCS '99), pp. 3447, Sept. 1999.
[10] G. Manzini, “An Analysis of the BurrowsWheeler Transform,” J.ACM, vol. 48, no. 3, pp. 407430, May 2001.
[11] Z. Arnavut and M. Arnavut, “Investigation of BlockSorting of Multiset Permutations,” Int'l J. Computer Math., vol. 81, no. 10, pp.12131222, Oct. 2004.
[12] Z. Arnavut, “Generalization of the BWT Transformation and Inversion Ranks,” Proc. Data Compression Conf. (DCC '02), p. 447, Apr. 2002.
[13] H. Yokoo, “Notes on BlockSorting Data Compression,” Electronics and Comm. in Japan (Part III: Fundamental Electronic Science), vol. 82, no. 6, pp. 1825, 1999.
[14] K. Sadakane, “A Fast Algorithm for Making Suffix Arrays and for BurrowsWheeler Transformation,” Proc. Data Compression Conf. (DCC '98), pp. 129138, Mar. 1998.
[15] D. Baron and Y. Bresler, “Antisequential Suffix Sorting for BWTBased Data Compression,” IEEE Trans. Computers, vol. 54, no. 4, pp. 385397, Apr. 2005.
[16] J. Karkkainen and P. Sanders, “Simple Linear Work Suffix Array Construction,” Proc. 30th Int'l Colloquium on Automata, Languages, and Programming (ICALP '03), pp. 943955, 2003.
[17] D.K. Kim, J.S. Sim, H. Park, and K. Park, “LinearTime Construction of Suffix Arrays,” Proc. 14th Ann. Symp. Combinatorial Pattern Matching, pp. 186199, 2003.
[18] P. Ko and S. Aluru, “Space Efficient Linear Time Construction of Suffix Arrays,” Proc. 14th Ann. Symp. Combinatorial Pattern Matching, pp. 200210, 2003.
[19] N.J. Larsson, “The Context Trees of Block Sorting Compression,” Proc. Data Compression Conf. (DCC '98), pp. 189198, Mar. 1998.
[20] R.M. Karp, R.E. Miller, and A.L. Rosenberg, “Rapid Identification of Repeated Patterns in Strings,” Proc. Fourth ACM Symp. Theory of Computing, pp. 125136, 1972.
[21] F. Hongo and H. Yokoo, “BlockSorting Data Compression and KMR Algorithm,” Proc. 20th Symp. Information Theory and Its Applications, pp. 673676, 1997.
[22] S.J. Puglisi, W.F. Smyth, and A. Turpin, “The Performance of Linear Time Suffix Sorting Algorithms,” Proc. Data Compression Conf. (DCC '05), pp. 358367, Mar. 2005.
[23] M. Schindler, “A Fast BlockSorting Algorithm for Lossless Data Compression,” Proc. Data Compression Conf. (DCC '97), p. 469, Mar. 1997.
[24] M. Schindler, “Method and Apparatus for Sorting Data Blocks,” US patent 6,199,064, Mar. 2001.
[25] M. Schindler, Szip Homepage, http://www.compressconsult. comszip/, 2007.
[26] I. Witten and T. Bell, Calgary Text Compression Corpus, ftp://ftp.cpsc.ucalgary.ca/pub/projectstext.compression.corpus /, 2007.
[27] T.B.R. Arnold, “A Corpus for the Evaluation of Lossless Compression Algorithms,” Proc. Data Compression Conf. (DCC '97), pp. 201210, , Mar. 1997.
[28] G. Nong, and S. Zhang, “Unifying the BurrowsWheeler and the Schindler Transforms,” Proc. Data Compression Conf. (DCC '06), p.464, Mar. 2006.
[29] G. Nong and S. Zhang, “An Efficient Algorithm for the Inverse ST Problem,” Proc. Data Compression Conf. (DCC '07), p. 397, Mar. 2007.
[30] S. Deorowicz, “Second Step Algorithms in the BurrowsWheeler Compression Algorithm,” Software—Practice and Experience, vol. 32, no. 2, pp. 99111, Feb. 2002.
[31] U. Manber and G. Myers, “Suffix Arrays: A New Method for OnLine String Searches,” Proc. First ACMSIAM Symp. Discrete Algorithms, pp. 319327, 1990.