DocumentCode
847283
Title
Dynamic programming alignment of sequences representing cyclic patterns
Author
Gregor, Jens ; Thomason, Michael G.
Author_Institution
Dept. of Comput. Sci., Tennessee Univ., Knoxville, TN, USA
Volume
15
Issue
2
fYear
1993
fDate
2/1/1993 12:00:00 AM
Firstpage
129
Lastpage
135
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
Keywords
dynamic programming; image sequences; medical image processing; algorithmic complexity; alignment costs; circularly permuted protein sequences; cyclic patterns; dynamic programming; guided search algorithm; optimal alignment cost; satellite DNA sequences; submatrices; Algorithm design and analysis; Cost function; DNA; Dynamic programming; Filling; Pattern analysis; Pattern matching; Proteins; Satellites; Sequences;
fLanguage
English
Journal_Title
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher
ieee
ISSN
0162-8828
Type
jour
DOI
10.1109/34.192484
Filename
192484
Link To Document