Motivation: The local alignment problem for two sequences requires determining similar regions one from each sequence, and aligning those regions. For alignments computed by dynamic programming, current approaches for selecting similar regions may hav
While the area of sequence comparison has a rich collection of results on the alignment of two seque...
Abstract. Multiple Sequence Alignment (MSA) is one of the most fundamen-tal problems in computationa...
An efficient algorithm is described to locate locally optimal alignments between two sequences allow...
Motivation: The local alignment problem for two sequences requires determining similar regions one f...
We present a dynamic programming algorithm for computing a best global alignment of two sequences. T...
We give a short survey of several pair-wise local and global sequence alignment algorithms, together...
MOTIVATION: Sequence alignments obtained using affine gap penalties are not always biologically corr...
Motivation: Homologous sequences are sometimes similar over some regions but different over other re...
Dynamic programming algorithms to determine similar regions of two sequences are useful for analyzin...
The level of conservation between two homologous sequences often varies among sequence regions; func...
Abstract — Pair wise sequence Alignment is one of the ways to arrange the two biological sequences t...
In this article, we consider dynamic programming algorithms for solving two bicriteria formulations ...
This thesis deals with sequence alignment algorithms. The sequence alignment is a mutual arrange of ...
This thesis deals with sequence alignment algorithms. The sequence alignment is a mutual arrange of ...
The study and comparison of sequences of characters from a finite alphabet is relevant to various ar...
While the area of sequence comparison has a rich collection of results on the alignment of two seque...
Abstract. Multiple Sequence Alignment (MSA) is one of the most fundamen-tal problems in computationa...
An efficient algorithm is described to locate locally optimal alignments between two sequences allow...
Motivation: The local alignment problem for two sequences requires determining similar regions one f...
We present a dynamic programming algorithm for computing a best global alignment of two sequences. T...
We give a short survey of several pair-wise local and global sequence alignment algorithms, together...
MOTIVATION: Sequence alignments obtained using affine gap penalties are not always biologically corr...
Motivation: Homologous sequences are sometimes similar over some regions but different over other re...
Dynamic programming algorithms to determine similar regions of two sequences are useful for analyzin...
The level of conservation between two homologous sequences often varies among sequence regions; func...
Abstract — Pair wise sequence Alignment is one of the ways to arrange the two biological sequences t...
In this article, we consider dynamic programming algorithms for solving two bicriteria formulations ...
This thesis deals with sequence alignment algorithms. The sequence alignment is a mutual arrange of ...
This thesis deals with sequence alignment algorithms. The sequence alignment is a mutual arrange of ...
The study and comparison of sequences of characters from a finite alphabet is relevant to various ar...
While the area of sequence comparison has a rich collection of results on the alignment of two seque...
Abstract. Multiple Sequence Alignment (MSA) is one of the most fundamen-tal problems in computationa...
An efficient algorithm is described to locate locally optimal alignments between two sequences allow...
DOI
Add to ORKG