Linear time algorithm for the longest common repeat problem |
| |
| Authors: | Inbok Lee Costas S. Iliopoulos Kunsoo Park |
| |
| Affiliation: | aSchool of Computer Science & Engineering, Seoul National University, Seoul, Republic of Korea;bDepartment of Computer Science, King's College London, London, United Kingdom |
| |
| Abstract: | ![]()
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. |
| |
| Keywords: | String algorithm Repeat Generalized suffix tree |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
