Linear time algorithm for the longest common repeat problem

Given a set of strings U={T1,T2,…,Tℓ}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.