From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization

Theoretical Computer Science

Volumn 387, Issue 3, 2007, Pages 236-248

  Giancarlo, R ^a   Restivo, A ^a   Sciortino, M ^a  

^a UNIVERSITY OF PALERMO   (Italy)

Author keywords

Burrows Wheeler transform; Lyndon word; Optimal word permutation; Suffix tree

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; DATA COMPRESSION; OPTIMIZATION; PROBLEM SOLVING;

BURROWS-WHEELER TRANSFORM; LYNDON WORD; OPTIMAL WORD PERMUTATION; SUFFIX TREE;

MATHEMATICAL TRANSFORMATIONS;

EID: 35448978711     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.07.019     Document Type: Article

References (17)

1. Arora A., Lund C., Motwani R., Sudan M., and Szegedy M. Proof verification and the hardness of approximation problems. Journal of the ACM 45 (1998) 501-555
2. Bentley J., Sleator D., Tarjan R., and Wei V. A locally adaptive compression scheme. Communications of the ACM 29 4 (1986) 320-330
3. Blum A., Li M., Tromp J., and Yannakakis M. Linear approximation of shortest superstrings. Journal of the ACM 41 (1994) 630-647
4. M. Burrows, D. Wheeler, A block sorting lossless data compression algorithm, Technical Report 124, Digital Equipment Corporation, 1994
5. B. Chapin, S.R. Tate, Higher compression from the Burrows-Wheeler transform by modified sorting, in: Data Compression Conference, 1998, p. 532
6. Choffrut C. On some combinatorial properties of metrics over a free monoid. In: Cummings L.J. (Ed). Combinatorics on Words. Progress and Perspectives (1983), Academic Press 247-255
7. Ferragina P., Giancarlo R., Manzini G., and Sciortino M. Boosting textual compression in optimal linear time. Journal of the ACM 52 (2005) 688-713
8. P. Ferragina, F. Luccio, G. Manzini, S. Muthukrishnan, Structuring labeled trees for optimal succinctness, and beyond, in: Proc. of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2005, pp. 198-207
9. Gusfield D. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology (1997), Cambridge University Press
10. Lothaire M. Combinatorics on Words. Encyclopedia of Mathematics vol. 17 (1983), Addison-Wesley, Reading, Mass. Reprinted in the Cambridge Mathematical Library, Cambridge University Press, 1997
11. Lothaire M. Applied Combinatorics on Words. Encyclopedia of Mathematics and its Applications vol. 105 (2005), Cambridge University Press
12. Mantaci S., Restivo A., and Sciortino M. Burrows-Wheeler transform and Sturmian words. Information Processing Letters 86 (2003) 241-246
13. Manzini G. An analysis of the Burrows-Wheeler transform. Journal of the ACM 48 3 (2001) 407-430
14. Mignosi F., and Restivo A. Periodicity. In: Lothaire M. (Ed). Algebraic Combinatorics on Words (2002), Cambridge University Press 237-274
15. Navarro G., and Mäkinen V. Compressed full-text indexes. ACM Computing Surveys 39 1 (2007)
16. Papadimitriou C.H., and Yannakakis M. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43 3 (1991) 425-440
17. Puglisi S.J., Smith W.F., and Turpin A. A taxonomy of suffix array contruction algorithms. ACM Computing Surveys 39 2 (2007)