This program computes Lempel Ziv(LZ77) factorization from input text,
which was made by Keisuke Goto, Hideo Bannai.
The original algorithm is proposed by Keisuke Goto and Hideo Bannai.
Details of the algorithm are available in http://arxiv.org/abs/1310.1448.
The souce code is hosted at http://code.google.com/p/bgone/ .

All source codes are licensed by MIT License.
You can read the details in LICENSE file.

We partly use souce codes made by G. Nong and J. Karkkainen et.al,
saca-k.cpp by G. Nong,
the reading_text function within bgCommon.cpp by J. Karkkainen et.al.
Their source codes are available at http://code.google.com/p/ge-nong/
and https://www.cs.helsinki.fi/group/pads/lz77.html respectively.


Scons (http://www.scons.org/) is used for the building process.
Just type "scons" if you have it installed.

-- Description

This package contains implementations of linear time algorithms computing
the Lempel Ziv(LZ77) factorization (also known as LZ77 parsing) from the paper

Keisuke Goto, Hideo Bannai:
Space Efficient Linear Time Lempel-Ziv Factorization for Small Alphabets. DCC 2014: 163-172
http://dx.doi.org/10.1109/DCC.2014.62
http://arxiv.org/abs/1310.1448

Implemented algorithms:

  BGone  - uses 5n bytes of space (assuming 32-bit integers and byte alphabet),
          This is the most space efficient algorithm.
  BGtwo  - uses 9n bytes of space. 

Given space requirements include the input text of n bytes but exclude the
output factorization.


-- Terms of use

If you use this code for experiments in a research paper, please cite the
paper mentioned above and publish the URL from which you downloaded the code.


-- How to use
See the help option, BGone -h or BGtwo -h.