Linear time algorithm for the longest common repeat problem

Inbok Lee, Costas S. Iliopoulos, Kunsoo Park
2007 Journal of Discrete Algorithms  
Given a set of strings U = {T 1 , T 2 , . . . , 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.
doi:10.1016/j.jda.2006.03.019 fatcat:gwc4vuy5bjfu7ipo4e4q2aogia