Tandem cyclic alignment

Authors:
Gary Benson
Affiliations:
Department of Computer Science, Department of Biology, Boston University, 44 Cummington Street, Boston, MA 02215, USA
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 5
Cited 1

On a cyclic string-to-string correction problem

Information Processing Letters
Incremental String Comparison

SIAM Journal on Computing
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)
Identifying Periodic Occurrences of a Template with Applications to Protein Structures

CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching

Periodic String Comparison

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.05

Visualization

Abstract

We present a solution for the following problem. Given two sequences X=x"1x"2...x"n and Y=y"1y"2...y"m, n=