Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

SPIRE
2004
Springer

favoriteEmaildiscussreport

84views Information Technology» more SPIRE 2004»

Linear Time Algorithm for the Longest Common Repeat Problem

13 years 10 months ago

Linear Time Algorithm for the Longest Common Repeat Problem

Download www.dcs.kcl.ac.uk

Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to ﬁnd 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 suﬃx tree

Inbok Lee, Costas S. Iliopoulos, Kunsoo Park

Real-time Traffic

Common Repeat Problem | Longest Common Repeat | Longest Common Substring | SPIRE 2004 |

claim paper

Related Content

» Linear Time Algorithm for the Generalised Longest Common Repeat Problem

» A genetic algorithm for the longest common subsequence problem

» Simple LinearTime OffLine Text Compression by LongestFirst Substitution

» A Load Balancing Technique for Some CoarseGrained Multicomputer Algorithms

» Algorithms for Computing the Longest Parameterized Common Subsequence

» A BSPCGM Algorithm for the AllSubstrings Longest Common Subsequence Problem

» A CoarseGrained Multicomputer Algorithm for the Longest Common Subsequence Problem

» Algorithms for computing variants of the longest common subsequence problem

» Analysis of evolutionary algorithms for the longest common subsequence problem

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	SPIRE
Authors	Inbok Lee, Costas S. Iliopoulos, Kunsoo Park

Comments (0)