LCS - Longest Common Substring

This program finds all longest common substrings between two files. The implementation is based on the Knuth-Morris-Pratt (KMP) algorithm. This C implementation uses multiple threads. Most times the program can find the length of the longest common substring in the first round. In the second round this length is verified. The third round prints the results to stdout. I programmed this for the lecture 'Fundamental Algorithms' at the university of paderborn.

Download

Input Specification

The program is called with two text files as parameters. The textfiles have no specific format.

Output Specifiction

The first line of the output is the length of the longest common substring. Every following line contains the shifts the string occurs in the first and second file.

License

//    Fast Longest Common Substring calculator using KMP algorithm
//    Copyright (C) 2011 Markus Pargmann (mpargman_AT_allfex.org)
//
//    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 3 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, see <http://www.gnu.org/licenses/>.