Linear Time Algorithm for the Generalised Longest Common Repeat Problem

Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U, considering direct, inverted, mirror as well as everted repeats. In this paper we define the generalised longest common repeat problem, where we can set the number of times that a repeat should appear in each string. We present a linear time algorithm for this problem using the suffix array. We also show an application of our algorithm for finding a longest common substring which appears only in a subset U of U but not in U − U .

• Type: Conference
• Year: 2005
• Where: SPIRE
• Authors: Inbok Lee, Yoan José Pinzón Ardila
• Keywords: Common Repeat Problem, Longest Common Repeat, Longest Common Substring, SPIRE 2005