A Simple Algorithm for Finding Exact Common Repeats

Inbok LEE; Yoan PINZON

doi:10.1093/ietisy/e90-d.12.2096

Copy

Inbok LEE, Yoan PINZON, "A Simple Algorithm for Finding Exact Common Repeats" in IEICE TRANSACTIONS on Information, vol. E90-D, no. 12, pp. 2096-2099, December 2007, doi: 10.1093/ietisy/e90-d.12.2096.
Abstract: Given a set of strings U = {T₁, T₂, ...,T}, the longest common repeat problem is to find the longest common substring that appears at least twice in each string, considering direct, inverted, and mirror repeats. We define the generalised longest common repeat problem and present a linear time solution.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e90-d.12.2096/_p

Copy

@ARTICLE{e90-d_12_2096,
author={Inbok LEE, Yoan PINZON, },
journal={IEICE TRANSACTIONS on Information},
title={A Simple Algorithm for Finding Exact Common Repeats},
year={2007},
volume={E90-D},
number={12},
pages={2096-2099},
abstract={Given a set of strings U = {T₁, T₂, ...,T}, the longest common repeat problem is to find the longest common substring that appears at least twice in each string, considering direct, inverted, and mirror repeats. We define the generalised longest common repeat problem and present a linear time solution.},
keywords={},
doi={10.1093/ietisy/e90-d.12.2096},
ISSN={1745-1361},
month={December},}

Copy

TY - JOUR
TI - A Simple Algorithm for Finding Exact Common Repeats
T2 - IEICE TRANSACTIONS on Information
SP - 2096
EP - 2099
AU - Inbok LEE
AU - Yoan PINZON
PY - 2007
DO - 10.1093/ietisy/e90-d.12.2096
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E90-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2007
AB - Given a set of strings U = {T₁, T₂, ...,T}, the longest common repeat problem is to find the longest common substring that appears at least twice in each string, considering direct, inverted, and mirror repeats. We define the generalised longest common repeat problem and present a linear time solution.
ER -