✦ LIBER ✦

Optimal sequence alignment using affine gap costs

✍ Scribed by Stephen F. Altschul; Bruce W. Erickson

Book ID: 108393536
Publisher: Springer
Year: 1986
Tongue: English
Weight: 878 KB
Volume: 48
Category: Article
ISSN: 1522-9602
DOI: 10.1016/s0092-8240(86)90010-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal sequence alignment using affine

Optimal sequence alignment using affine gap costs

✍ Stephen F. Altschul; Bruce W. Erickson 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 634 KB

Normalization of Affine Gap Costs Used i

Normalization of Affine Gap Costs Used in Optimal Sequence Alignment

✍ Lloyd Allison 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 226 KB

It is shown how to normalize the costs of an alignment algorithm that employs affine or linear gap costs. The normalized costs are interpreted as the -log probabilities of the instructions of a finite-state edit-machine. This gives an explicit model relating sequences that can be linked to processes

Generalized affine gap costs for protein

Generalized affine gap costs for protein sequence alignment

✍ Stephen F. Altschul 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB

Based on the observation that a single mutational event can delete or insert multiple residues, affine gap costs for sequence alignment charge a penalty for the existence of a gap, and a further length-dependent penalty. From structural or multiple alignments of distantly related proteins, it has be

Fast, Optimal Alignment of Three Sequenc

Fast, Optimal Alignment of Three Sequences Using Linear Gap Costs

✍ DAVID R. POWELL; LLOYD ALLISON; TREVOR I. DIX 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 160 KB

Alignment algorithms can be used to infer a relationship between sequences when the true relationship is unknown. Simple alignment algorithms use a cost function that gives a "xed cost to each possible point mutation\*mismatch, deletion, insertion. These algorithms tend to "nd optimal alignments tha

Optimal sequence alignment allowing for

Optimal sequence alignment allowing for long gaps

✍ Osamu Gotoh 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 775 KB

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