
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Dror Baron, Yoram Bresler, "Antisequential Suffix Sorting for BWTBased Data Compression," IEEE Transactions on Computers, vol. 54, no. 4, pp. 385397, April, 2005.  
BibTex  x  
@article{ 10.1109/TC.2005.56, author = {Dror Baron and Yoram Bresler}, title = {Antisequential Suffix Sorting for BWTBased Data Compression}, journal ={IEEE Transactions on Computers}, volume = {54}, number = {4}, issn = {00189340}, year = {2005}, pages = {385397}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2005.56}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Antisequential Suffix Sorting for BWTBased Data Compression IS  4 SN  00189340 SP385 EP397 EPD  385397 A1  Dror Baron, A1  Yoram Bresler, PY  2005 KW  Burrows Wheeler transform KW  data compression KW  source coding KW  suffix sorting KW  VLSI. VL  54 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, Palo Alto, Calif., May 1994.
[2] M. Effros, K. Visweswariah, S. Kulkarni, and S. Verdú, “Universal Lossless Source Coding with the Burrows Wheeler Transform,” IEEE Trans. Information Theory, vol. 48, no. 5, pp. 10611081, May 2002.
[3] M. Effros, “PPM Performance with BWT Complexity: A Fast and Effective Data Compression Algorithm,” Proc. IEEE, vol. 88, no. 11, pp. 17031712, Nov. 2000.
[4] 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.
[5] M. Nelson, “Data Compression with the BurrowsWheeler Transform,” Dr. Dobb's J., pp. 4650, Sept. 1996.
[6] J.G. Cleary, W.J. Teahan, and I.H. Witten, “Unbounded Length Contexts for PPM,” Proc. Data Compression Conf., pp. 5261, Mar. 1995.
[7] F.M.J. Willems, W.M. Shtarkov, and T.J. Tjalkens, “The ContextTree Weighting Method: Basic Properties,” IEEE Trans. Information Theory, vol. 41, no. 3, pp. 653664, May 1995.
[8] J. Rissanen, “Fast Universal Coding with Context Models,” IEEE Trans. Information Theory, vol. 45, no. 4, pp. 10651071, May 1999.
[9] D. Baron and Y. Bresler, “Tree Source Identification with the Burrows Wheeler Transform,” Proc. 2000 Conf. Information Sciences and Systems, pp. FA110FA115, Mar. 2000.
[10] D. Baron and Y. Bresler, “An $O(N)$ Semipredictive Universal Encoder via the BWT,” IEEE Trans. Information Theory, vol. 50, no. 5, pp. 928937, May 2004.
[11] J. Ziv and A. Lempel, “A Universal Algorithm for Sequential Data Compression,” IEEE Trans. Information Theory, vol. 23, no. 3, pp. 337343, May 1977.
[12] N. Ranganathan and S. Henriques, “HighSpeed VLSI Designs for LempelZivBased Data Compression,” IEEE Trans. Circuits and SystemsII: Analog and Digital Signal Processing, vol. 40, no. 2, pp. 96106, Feb. 1993.
[13] K.J. Lin and C.W. Wu, “A LowPower CAM Design for LZ Data Compression,” IEEE Trans. Computers, vol. 49, no. 10, pp. 11391145, Oct. 2000.
[14] P. Elias, “Interval and Recency Rank Source Coding: Two OnLine Adaptive VariableLength Schemes,” IEEE Trans. Information Theory, vol. 33, no. 1, pp. 310, Jan. 1987.
[15] S. Jones, “100 Mbit/s Adaptive Data Compressor Design Using Selectively Shiftable ContentAddressable Memory,” IEE Proc.G Circuits Devices & Systems, vol. 139, no. 4, pp. 498502, Aug. 1992.
[16] J.F. Myoupo and A. Wabbi, “MovetoFront and Transpose Hybrid Parallel Architectures for HighSpeed Data Compression,” Proc. 19th IEEE Int'l Performance, Computing, and Comm. Conf. (IPCCC 2000), pp. 6775, Feb. 2000.
[17] S. Jones, “PartialMatching Lossless Data Compression Hardware,” IEE Proc.E Computers & Digital Techniques, vol. 147, no. 5, pp. 329334, Sept. 2000.
[18] M. Schindler, “A Fast BlockSorting Algorithm for Lossless Data Compression,” Proc. Data Compression Conf., p. 469, Mar. 1997.
[19] D. Baron, “Fast Parallel Algorithms for Universal Lossless Source Coding,” PhD dissertation, Univ. of Illinois, Urbana, Feb. 2003.
[20] T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. Cambridge, Mass.: MIT Press, 1990.
[21] P. Weiner, “Linear Pattern Matching Algorithm,” Proc. IEEE 14th Symp. Switching and Automata Theory, pp. 111, Oct. 1973.
[22] E.M. McCreight, “A SpaceEconomical Suffix Tree Construction Algorithm,” J. ACM, vol. 23, no. 2, pp. 262272, Apr. 1976.
[23] N.J. Larsson, “Extended Application of Suffix Trees to Data Compression,” Proc. Data Compression Conf., pp. 190199, Apr. 1996.
[24] S. Kurtz, “Reducing the Space Requirement of Suffix Trees,” Software— Practice and Experience, vol. 29, no. 13, pp. 11491171, 1999.
[25] E. Ukkonen, “OnLine Construction of Suffix Trees,” Algorithmica, vol. 14, no. 3, pp. 249260, Sept. 1995.
[26] J. Seward, “On the Performance of BWT Sorting Algorithms,” Proc. Data Compression Conf., pp. 173182, Mar. 2000.
[27] J.L. Bentley and R. Sedgewick, “Fast Algorithms for Sorting and Searching Strings,” Proc. ACMSIAM Symp. Discrete Algorithms, pp. 360369, Jan. 1997.
[28] N.J. Larsson and K. Sadakane, “Faster Suffix Sorting,” Technical Report LUCSTR:99214, Dept. of Computer Science, Lund Univ., Sweden, May 1999.
[29] R.M. Karp, R.E. Miller, and A.L. Rosenberg, “Rapid Identification of Repeated Patterns in Strings, Trees and Arrays,” Proc. IEE Symp. Foundations of Computer Science, pp. 125136, May 1972.
[30] J. Kärkkäinen and P. Sanders, “Simple Linear Work Suffix Array Construction,” Proc. 30th Int'l Colloquium Automata, Languages, and Programming, pp. 943955, 2003.
[31] P. Ko and S. Aluru, “SpaceEfficient Linear Time Construction of Suffix Arrays,” Proc. 14th Ann. Symp. Combinatorial Pattern Matching, pp. 200210, 2003.
[32] 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.
[33] W. Hon, K. Sadakane, and W. Sung, “Breaking a TimeandSpace Barrier in Constructing FullText Indices,” Proc. 44th Ann. IEEE Symp. Foundations of Computer Science (FOCS '03), pp. 251260, Oct. 2003.
[34] S. Burkhardt and J. Kärkkäinen, “Fast Lightweight Suffix Array Construction and Checking,” Proc. 14th Ann. Symp. Combinatorial Pattern Matching, pp. 5569, 2003.
[35] G. Manzini and P. Ferragina, “Engineering a Lightweight Suffix Array Construction Algorithm,” Proc. 10th European Symp. Algorithms, pp. 698710, 2002.
[36] J. Seward, “Spacetime Tradeoffs in the Inverse BW Transform,” Proc. Data Compression Conf., pp. 439448, Mar. 2001.