Dynamic Programming Alignment of Sequences Representing Cyclic Patterns

Authors:
Jens Gregor;Michael G. Thomason
Affiliations:
-;-
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1993

Citing 3
Cited 6

On a cyclic string-to-string correction problem

Information Processing Letters
Optimal Correspondence of String Subsequences

IEEE Transactions on Pattern Analysis and Machine Intelligence
The String-to-String Correction Problem

Journal of the ACM (JACM)

Dynamic Programming for Detecting, Tracking, and Matching Deformable Contours

IEEE Transactions on Pattern Analysis and Machine Intelligence
Flexible syntactic matching of curves and its application to automatic hierarchal classification of silhouettes

IEEE Transactions on Pattern Analysis and Machine Intelligence
Flexible Syntactic Matching of Curves and Its Application to Automatic Hierarchical Classification of Silhouettes

IEEE Transactions on Pattern Analysis and Machine Intelligence
Combining Appearance and Topology for Wide Baseline Matching

ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part I
Efficient Techniques for a Very Accurate Measurement of Dissimilarities between Cyclic Patterns

Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Cyclic sequence comparison using dynamic warping

CIVR'05 Proceedings of the 4th international conference on Image and Video Retrieval

Quantified Score

Hi-index	0.14

Visualization

Abstract

String alignment by dynamic programming is generalized to include cyclic shift and corresponding optimal alignment cost for strings representing cyclic patterns. A guided search algorithm uses bounds on alignment costs to find all optimal cyclic shifts. The bounds are derived from submatrices of an initial dynamic programming matrix. Algorithmic complexity is analyzed for major stages in the search. The applicability of the method is illustrated with satellite DNA sequences and circularly permuted protein sequences.