Periodic String Comparison

Authors:
Alexander Tiskin
Affiliations:
Department of Computer Science, University of Warwick, Coventry, UK CV4 7AL
Venue:
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Year:
2009

Citing 8
Cited 0

Identifying periodic occurrences of a template with applications to protein structure

Information Processing Letters
All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings

SIAM Journal on Computing
The String-to-String Correction Problem

Journal of the ACM (JACM)
On the common substring alignment problem

Journal of Algorithms
Two algorithms for LCS Consecutive Suffix Alignment

Journal of Computer and System Sciences
An all-substrings common subsequence algorithm

Discrete Applied Mathematics
Semi-local longest common subsequences in subquadratic time

Journal of Discrete Algorithms
Tandem cyclic alignment

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In our previous work, we introduced the concept of semilocal string comparison, and developed for it an efficient method called the seaweed algorithm. In the current paper, we introduce its extension, called the periodic seaweed algorithm. The new algorithm allows efficient exploitation of the periodic structure in one of the input strings. By application of the periodic seaweed algorithm, we obtain new algorithms for the tandem LCS problem and the tandem cyclic alignment problem, improving on existing algorithms in running time.