/***************************************************************************
 *   Sadakane's Compressed suffix tree implementation version 1.0          *
 *                                                                         *
 *   Copyright (C) 2006 by Niko Vlimki, Kashyap Dixit,                   *
 *                         Wolfgang Gerlach, and Veli Mkinen              *
 *                                                                         *
 *   This program is free software; you can redistribute it and/or modify  *
 *   it under the terms of the GNU General Public License as published by  *
 *   the Free Software Foundation; either version 2 of the License, or     *
 *   (at your option) any later version.                                   *
 *                                                                         *
 *   This program is distributed in the hope that it will be useful,       *
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of        *
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         *
 *   GNU General Public License for more details.                          *
 *                                                                         *
 *   You should have received a copy of the GNU General Public License     *
 *   along with this program; if not, write to the                         *
 *   Free Software Foundation, Inc.,                                       *
 *   51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.         *
 ***************************************************************************/

/***************************************************************************
 * References:                                                             *
 *                                                                         *
 * Niko Vlimki, Wolfgang Gerlach, Kashyap Dixit, and Veli Mkinen.       *
 * Engineering a Compressed Suffix Tree Implementation,                    *
 * Published at 6th Workshop on Experimental Algorithms (WEA 2007),        *
 * June 6-8, Italy.                                                        *
 *                                                                         *
 * K. Sadakane. Compressed suffix trees with full functionality. Theory of * 
 * Computing Systems, 2006. To appear, preliminary version available at    *
 * http://tcslab.csce.kyushu-u.ac.jp/~sada/papers/cst.ps                   *
 *                                                                         *
 ***************************************************************************/
 
Compile: make

Run: TestLCSS

Program TestLCSS.cpp is an illustrative example of the usage of compressed 
suffix tree. It implements Longest Common Substring algorithm. 
Studying this should help in implementing ones own algorithms using the 
compressed suffix tree interface.   
