AbstractDynamic programming algorithms to determine similar regions of two sequences are useful for analyzing biosequence data. This paper presents a time-efficient algorithm that produces k best “non-intersecting” local alignments for any chosen k. The algorithm's main strength is that it needs only O(M + N + K) space, where M and N are the lengths of the given sequences and K is the total length of the computed alignments
The tremendous quantity and quality of data obtained by conformations of DNA and protein sequences m...
Aligning large nucleotide sequences requires significant portion of the memory, what in some cases ...
We give a short survey of several pair-wise local and global sequence alignment algorithms, together...
Dynamic programming algorithms to determine similar regions of two sequences are useful for analyzin...
Existing dynamic-programming algorithms for identifying similar regions of two sequences require tim...
The local similarity problem is to determine the similar regions within two given sequences. We rece...
A new, time and space efficient alignment methodology is presented, applicable on similar nucleotid...
An efficient algorithm is described to locate locally optimal alignments between two sequences allow...
MOTIVATION: Sequence alignments obtained using affine gap penalties are not always biologically corr...
Abstract — Pair wise sequence Alignment is one of the ways to arrange the two biological sequences t...
Abstract. The Local Alignment problem is a classical problem with ap-plications in biology. Given tw...
Sequence local alignment is to find two subsequences from the input two sequences respectively, whic...
Sequence alignment is an important tool for describing relationships between sequences. Many sequenc...
The study and comparison of sequences of characters from a finite alphabet is relevant to various ar...
Motivation: Homologous sequences are sometimes similar over some regions but different over other re...
The tremendous quantity and quality of data obtained by conformations of DNA and protein sequences m...
Aligning large nucleotide sequences requires significant portion of the memory, what in some cases ...
We give a short survey of several pair-wise local and global sequence alignment algorithms, together...
Dynamic programming algorithms to determine similar regions of two sequences are useful for analyzin...
Existing dynamic-programming algorithms for identifying similar regions of two sequences require tim...
The local similarity problem is to determine the similar regions within two given sequences. We rece...
A new, time and space efficient alignment methodology is presented, applicable on similar nucleotid...
An efficient algorithm is described to locate locally optimal alignments between two sequences allow...
MOTIVATION: Sequence alignments obtained using affine gap penalties are not always biologically corr...
Abstract — Pair wise sequence Alignment is one of the ways to arrange the two biological sequences t...
Abstract. The Local Alignment problem is a classical problem with ap-plications in biology. Given tw...
Sequence local alignment is to find two subsequences from the input two sequences respectively, whic...
Sequence alignment is an important tool for describing relationships between sequences. Many sequenc...
The study and comparison of sequences of characters from a finite alphabet is relevant to various ar...
Motivation: Homologous sequences are sometimes similar over some regions but different over other re...
The tremendous quantity and quality of data obtained by conformations of DNA and protein sequences m...
Aligning large nucleotide sequences requires significant portion of the memory, what in some cases ...
We give a short survey of several pair-wise local and global sequence alignment algorithms, together...
DOI
Add to ORKG