๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Near-optimal sequence alignment

โœ Scribed by Martin Vingron

Book ID
117656055
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
681 KB
Volume
6
Category
Article
ISSN
0959-440X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Optimal sequence alignment allowing for
Optimal sequence alignment allowing for long gaps
โœ Osamu Gotoh ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Springer ๐ŸŒ English โš– 735 KB

A new algorithm for optimal sequence alignment allowing for long insertions and deletions is developed. The algorithm requires O((L+C)MN) computational steps, O(LN) primary memory and O(MN) secondary memory storage, where M and N (M~> N) are sequence lengths, L (typically L~< 3) is the number of seg

Consistency of optimal sequence alignmen
Consistency of optimal sequence alignments
โœ Osamu Gotoh ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Springer ๐ŸŒ English โš– 944 KB

Pairwise optimal alignments between three or more sequences are not necessarily consistent as a whole, but consistent and inconsistent residues are usually distributed in clusters. An efficient method has been developed for locating consistent regions when each pairwise alignment is given in the for