perl-String-LCSS_XS

Find The Longest Common Substring of Two Strings

SRPM:     perl-String-LCSS_XS-0.4-1.n0i.3.fc9.src.rpm
SPEC:     perl-String-LCSS_XS.spec
Version:  0.4
Release:  1.n0i.3.fc9
Epoch:    
License:  GPL+ or Artistic
Group:    Development/Libraries
Size:     46005
Packager: Marius Feraru <altblue@n0i.net>
Vendor:   n0i.net
URL:      http://search.cpan.org/dist/String-LCSS_XS/
Date:     Sun Nov 25 2007, 21:46 GMT

Description:

String::LCSS_XS computes the Longest Common Substring of two strings.
It is a C implementation of String::LCSS and uses a dynamic programming
algorithm with both runtime and memory usage of O(mn).

Changelog:

  • Sun Nov 25 2007 Marius Feraru <altblue@n0i.net> - 0.4-1.n0i.3
    - version 0.4
  • Sat Nov 24 2007 Marius Feraru <altblue@n0i.net> - 0.3-1.n0i.2
    - version 0.3
  • Thu Nov 22 2007 Marius Feraru <altblue@n0i.net> - 0.2-1.n0i.1
    - initial packaging

Files:

  • perl-String-LCSS_XS.spec
  • String-LCSS_XS-0.4.tar.gz

Requires:

  • rpm-build-reb00t-perl
  • rpmlib(CompressedFileNames)