Informasi seputar BWT :

  1. Michael Burrows and David Wheeler, A Block-Sorting Lossless Data Compression Algorithm, Digital Systems Research Center, SRC Research Report 124, Palo Alto, California, 1994.
  2. Peter Fenwick, Experiments with a Block Sorting Text Compression Algorithm, The University of Auckland, Department of Computer Science, Technical Report 111, 1995.
  3. Peter Fenwick, Improvements to the Block Sorting Text Compression Algorithm, The University of Auckland, Department of Computer Science, Technical Report 120, 1995.
  4. Peter Fenwick, Block Sorting Text Compression, Proceedings of the 19th Australasian Computer Science Conference, Melbourne, Australia, 1996.
  5. Peter Fenwick, Block Sorting Text Compression Final Report, The University of Auckland, Department of Computer Science, Technical Report 130, 1996.
  6. Mark Nelson, Data Compression with the Burrows-Wheeler Transform, Dr. Dobb’s Journal, 1996.
  7. Ziya Arnavut and Spyros Magliveras, Block Sorting and Compression, Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, pp. 181-190, 1997.
  8. Ziya Arnavut and Spyros Magliveras, Lexical Permutation Sorting Algorithm, The Computer Journal, 40(5), pp. 292-295, 1997.
  9. Michael Schindler, A Fast Block-sorting Algorithm for lossless Data Compression, Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, pp. 469-, 1997.
  10. Haitao Guo, Wavelets for Approximate Fourier Transform and data Compression, Dissertation, may 1997.
  11. Bernhard Balkenhol and Stefan Kurtz, Universal Data Compression Based on the Burrows and Wheeler-Transformation: Theory and Practice, Preprint 98-069, SFB343: Discrete Structures in Mathematics, Falculty of Mathematics, University of Bielefeld, 1998.
  12. Brenton Chapin and Stephen Tate, Higher Compression from the Burrows-Wheeler Transform by Modified Sorting, Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, pp. 532-, 1998.
  13. Bernhard Balkenhol, Stefan Kurtz and Yuri Shtarkov, Modifications of the Burrows and Wheeler Data Compression Algorithm, Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, pp. 188-197, 1999.
  14. Bernhard Balkenhol and Yuri Shtarkov, One attempt of a compression algorithm using the BWT, Preprint 99-133, SFB343: Discrete Structures in Mathematics, Falculty of Mathematics, University of Bielefeld, 1999.
  15. Arturo Campos, Burrows and Wheeler Transformation, 1999.
  16. Giovanni Manzini, The Burrows-Wheeler Transform: Theory and Practice, Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science, Szklarska Poreba, Poland, LNCS 1672, Springer-Verlag, pp. 34-47, 1999.
  17. Bernhard Balkenhol and Stefan Kurtz, Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice, IEEE Transactions on Computers, 49(10), pp. 1043-1053, 2000.
  18. Dror Baron and Yoram Bresler, Tree Source Identification with the Burrows Wheeler Transform, Proceedings of the 34th Annual Conference on Information Sciences and Systems, Princeton New Jersey, FA1-10-FA1-15, 2000.
  19. Sebastian Deorowicz, Improvements to Burrows-Wheeler Compression Algorithm, Software-Practice and Experience, 30(13), pp. 1465-1483, 2000.
  20. Stefan Kurtz and Bernhard Balkenhol, Space Efficient Linear Time Computation of the Burrows and Wheeler-Transformation, Numbers, Information and complexity, pp. 375-383, 2000.
  21. Kunihiko Sadakane, Unifying Text Search And Compression Suffix Sorting, Block Sorting and Suffix Arrays, PhD thesis, University of Tokyo, 2000.
  22. Giovanni Manzini, An Analysis of the Burrows-Wheeler Transform, Journal of the ACM, 48(3), pp. 407-430, 2001.
  23. Julian Seward, Space-time tradeoffs in the Inverse B-W Transform, Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, pp. 439-448, 2001.
  24. Anthony Wirth, Symbol-driven compression of Burrows Wheeler transformed text, Masters thesis, The University of Melbourne, 2001.
  25. Brenton Chapin, Higher Compression from the Burows-Wheeler Transform with new Algorithms for the list Update Problem, Disertation, mai 2001.
  26. Sebastian Deorowicz, Second step algorithms in the Burrows-Wheeler compression algorithm, Software-Practice and Experience, 32(2), pp. 99-111, 2002.
  27. Michelle Effros, Karthik Visweswariah, Sanjeev Kulkarni and Sergio Verdú, Universal Lossless Source Coding With the Burrows Wheeler Transform, IEEE Transactions on Information Theory, 48(5), pp. 1061-1081, 2002.
  28. R. Yugo Kartono Isal, Alistair Moffat and Alwin C. H. Ngai, Enhanced Word-Based Block-Sorting Text Compression, Proceedings of the 25th Australasian Computer Science Conference, Melbourne, pp. 129-138, 2002.
  29. Jürgen Abel, Improvements to the Burrows-Wheeler Compression Algorithm: After BWT Stages, 2003.
  30. Richard Bird and Shin-cheng Mu, Inverting the Burrows-Wheeler Transform, Journal of Functional Programming Special Issue on Functional Pearls, 2003.
  31. Sebastian Deorowicz, Universal lossless data compression algorithms, PhD thesis, Silesian University of Technology, 2003.
  32. Peter Fenwick, Mark Titchener and Michelle Lorenz, Burrows Wheeler Alternatives to Move to Front, Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, pp. 428-, 2003.
  33. Dror Baron and Yoram Bresler, An O(N) Semi-Predictive Universal Encoder via the BWT, IEEE Transactions on Information Theory, 50(5), pp. 928-937, 2004.
  34. Michael Dipperstein, Burrows-Wheeler Transform Discussion and Implementation, 2004.
  35. Peter Fenwick, Reflections on the Burrows Wheeler transform, The University of Auckland, Department of Computer Science, Technical Report 172, 2004.
  36. Paolo Ferragina and Giovanni Manzini, Compression Boosting in Optimal Linear Time Using the Burrows-Wheeler Transform, Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms, pp. 655-663, 2004.
  37. Luca Foschini, Roberto Grossi, Ankur Gupta and Jeffrey Vitter, Fast Compression with a Static Model in High-Order Entropy, Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, pp. 62-71, 2004.
  38. Juha Kärkkäinen, Fast BWT in small space by blockwise suffix sorting, Proceedings DIMACS Working Group on The Burrows-Wheeler Transform: Ten Years Later, pp. 12-13, 2004
  39. Dror Baron and Yoram Bresler, Anti-Sequential Suffix Sorting for BWT-Based Data Compression, IEEE Transactions on Computers, 54(4), pp. 385-397, 2005. 
  40. Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini and Marinella Sciortino, Boosting Textual Compression in Optimal Linear Time, Journal of the ACM, 52(4), pp. 688-713, 2005.
  41. Ulrich Lauther and Tamás Lukovszki, Space Efficient Algorithms for the Burrows-Wheeler Backtransformation, Proceedings of the 13th Annual European Symposium on Algorithms, LNCS 3669, Springer-Verlag, pp. 293-304, 2005.
  42. Ross Lippert, Clark Mobarry and Brian Walenz, A space-efficient construction of the Burrows Wheeler transform for genomic data, Journal of Computational Biology, 2005.
  43. Ross Lippert, Space-efficient whole genome comparisons with Burrows-Wheeler transforms, Journal of Computational Biology, 12(4), pp. 407-415, 2005
  44. Paolo Ferragina, Raffaele Giancarlo and Giovanni Manzini, The Engineering of a Compression Boosting Library: Theory vs Practice in BWT compression, Proceedings of the 14th European Symposium on Algorithms, LNCS 4168, Springer-Verlag, pp. 756-767, 2006.
  45. Paolo Ferragina, Raffaele Giancarlo and Giovanni Manzini, The Myriad Virtues of Wavelet Trees, Proceedings of the 33rd International Colloquium on Automata, Languages and Programming, LNCS 4051, Springer-Verlag, pp. 561-572, 2006.
  46. Haim Kaplan, Shir Landau and Elad Verbin, A Simpler Analysis of Burrows-Wheeler Based Compression, Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching, LNCS 4009, Springer-Verlag, pp. 282-293, 2006.
  47. Juha Kärkkäinen, Fast BWT in Small Space by Blockwise Suffix Sorting, Theoretical Computer Science, 2006.
  48. Haim Kaplan and Elad Verbin, Most Burrows-Wheeler Based Compressors are Not Optimal, Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching, LNCS 4580, Springer-Verlag, pp. 107-118, 2007.
  49. Peter Fenwick, Burrows–Wheeler compression : Principles and reflections, Theoretical Computer Science, 387, pp. 200-219, 2007.
  50. Travis Gagie and Giovanni Manzini, Move-to-Front, Distance Coding, and Inversion Frequencies Revisited, Proceedings of the 18th Symposium on Combinatorial Pattern Matching, LNCS 4580, Springer-Verlag, pp. 71-82, 2007.

<!–[endif]–>