Constrained sequence alignment.
This paper presents a dynamic programming algorithm for aligning two sequences when the alignment is constrained to lie between two arbitrary boundary lines in the dynamic programming matrix. For affine gap penalties, the algorithm requires only O(F) computations time and O(M+N) space, when F is the area of the feasible region and M and N are the sequence lengths. The result extends to concave gap penalities, with somewhat increased time and space bounds.
Chao
K M
KM
Department of Computer Science, The Pennsylvania State University, University Park, 16802, U.S.A.
Hardison
R C
RC
Miller
W
W
D000465:Algorithms; D002736:Chloroplasts; D016678:Genome; D010944:Plants / Q000235:genetics; D010947:Plants, Toxic; D016415:Sequence Alignment; D014026:Nicotiana / Q000235:genetics