
pmid: 8298508
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.
concave gap penalties, Nicotiana, Chloroplasts, Genome, Biochemistry, molecular biology, DNA, Plants, constrained sequence alignment, Plants, Toxic, Applications of mathematical programming, protein sequences, Computational methods for problems pertaining to biology, Semi-infinite programming, Sequence Alignment, affine gap penalties, Algorithms
concave gap penalties, Nicotiana, Chloroplasts, Genome, Biochemistry, molecular biology, DNA, Plants, constrained sequence alignment, Plants, Toxic, Applications of mathematical programming, protein sequences, Computational methods for problems pertaining to biology, Semi-infinite programming, Sequence Alignment, affine gap penalties, Algorithms
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 17 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
