𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Improved Algorithm for Array Alignment

✍ Scribed by Igor Milosavljević

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
327 KB
Volume
58
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for Automatic Alignment of Ar
Algorithms for Automatic Alignment of Arrays
✍ Siddhartha Chatterjee; John R. Gilbert; Leonid Oliker; Robert Schreiber; Thomas 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 355 KB

Aggregate data objects (such as arrays) are distributed across the processor memories when compiling a data-parallel language for a distributed-memory machine. The mapping determines the amount of communication needed to bring operands of parallel operations into alignment with each other. A common

Improved Approximation Algorithms for Tr
Improved Approximation Algorithms for Tree Alignment
✍ Lusheng Wang; Dan Gusfield 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 251 KB

Multiple sequence alignment is a task at the heart of much of current computaw x tional biology 4 . Several different objective functions have been proposed to formalize the task of multiple sequence alignment, but efficient algorithms are lacking in each case. Thus multiple sequence alignment is on

An Improved Algorithm for Statistical Al
An Improved Algorithm for Statistical Alignment of Sequences Related by a Star Tree
✍ István Miklós 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 102 KB

The insertion-deletion model developed by Thorne, Kishino and Felsenstein (1991, J. Mol. Evol., 33, 114-124; the TKF91 model) provides a statistical framework of two sequences. The statistical alignment of a set of sequences related by a star tree is a generalization of this model. The known algorit

An Improved Approximation Algorithm for
An Improved Approximation Algorithm for MULTIWAY CUT
✍ Gruia Călinescu; Howard Karloff; Yuval Rabani 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 132 KB

Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Multiway Cut is the problem of finding a multiway cut of minimum cost. Previously, a very simple combinatorial algorithm due

An Algorithm Combining DNA and Protein A
An Algorithm Combining DNA and Protein Alignment
✍ Jotun Hein 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 205 KB

An algorithm is presented that aligns two DNA sequences minimizing the overall amount of evolution that the associated proteins have experienced. It is generalized to minimizing a weighted average of protein and DNA evolution.