| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 431150 | Journal of Discrete Algorithms | 2007 | 7 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Inbok Lee, Costas S. Iliopoulos, Kunsoo Park,