white page

Suffix array を構築するためのライブラリ divsufsort の C++ 版を公開しました。テンプレートになっているので、libdivsufsortよりは使いやすいかもしれません。

  File: divsufsortxx-r1.zip
  Size: 17,462 bytes
   MD5: b762a9552ac869a30181952637975559

--------------------

links を更新。"Move-to-Front, ..." の二つ目のpdfはスライドです。

• Burrows-Wheeler Transform:
  • Peter Fenwick, Burrows-Wheeler compression : Principles and reflections, Theoretical Computer Science, 387, pp. 200-219, 2007.
    [.pdf (www.cs.auckland.ac.nz)]
  • 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.
    [.pdf (www.mfn.unipmn.it)] [.pdf (www.csd.uwo.ca)]
  • 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.
    [.ps (www.math.tau.ac.il)] [.ps (www.cs.tau.ac.il)]
• Suffix Arrays:
  • Klaus-Bernd Schurmann, Suffix Arrays in Theory and Practice, 2007.
    [.pdf (bieson.ub.uni-bielefeld.de)]