Sciweavers

SPIRE
2004
Springer

Linear Time Algorithm for the Longest Common Repeat Problem

14 years 4 months ago
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
Inbok Lee, Costas S. Iliopoulos, Kunsoo Park
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where SPIRE
Authors Inbok Lee, Costas S. Iliopoulos, Kunsoo Park
Comments (0)