Linear Time Algorithm for the 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. We also consider reversed and reverse-complemented repeats as well as normal repeats. We present a linear time algorithm for the longest common repeat problem. Key words: String algorithm, repeat, generalized suffix tree

• Type: Conference
• Year: 2004
• Where: SPIRE
• Authors: Inbok Lee, Costas S. Iliopoulos, Kunsoo Park
• Keywords: Common Repeat Problem, Longest Common Repeat, Longest Common Substring, SPIRE 2004