String-LCSS_XS version 0.4
==========================

String::LCSS_XS computes the Longest Common Substring of two strings
s and t. It is a C implementation of L<String::LCSS> and uses a 
dynamic programming algorithm with runtime of O(mn) and memory usage
of O(n) (m is the length of s and n the length of t). 


INSTALLATION

To install this module type the following:

   perl Makefile.PL
   make
   make test
   make install

COPYRIGHT AND LICENCE

Put the correct copyright and licence information here.

Copyright (C) 2007 by Markus Riester

This library is free software; you can redistribute it and/or modify
it under the same terms as Perl itself, either Perl version 5.8.6 or,
at your option, any later version of Perl 5 you may have available.


