GitHub

This Python program finds the longest common substring, using Rabin-Karp’s Algorithm.

There was an error while loading. Please reload this page. This Python program finds the longest common substring, using Rabin-Karp’s Algorithm. The input is two ...
GitHub

LPS-LCS-Algorithm-Analysis

LPS-LCS-Algorithm-Analysis The longest common substring (LCS) problem is a classic computational problem used all the time. This project explores LCS, a special case of it, the longest palindromic ...
IEEE

The extended longest common substring algorithm for spoken document retrieval

Abstract: The paper considers the spoken document retrieval problem. The proposed method uses a length of the longest common substring (LCS) algorithm for detection of query words. This method based ...
Europe PMC

A New Algorithm for Fast All-Against-All Substring Matching

We present a new and efficient algorithm to solve the ’threshold all vs. all’ problem, which involves searching of two strings (with length N and M respectively) for finding all maximal approximate ...
IEEE

Quadratic-backtracking algorithm for string reconstruction from substring compositions

Abstract: Motivated by the problem of deducing the structure of proteins using mass-spectrometry, we study the reconstruction of a string from the multiset of its substring compositions. We specialize ...