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

A space efficient algorithm for finding the best nonoverlapping alignment score

โœ Scribed by Gary Benson

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
819 KB
Volume
145
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A simple and space-efficient fragment-ch
A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences
โœ B. Morgenstern ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 534 KB

In the segment-based approach to sequence alignment. nucleic acid, and protein sequence alignments are constructed from fragments, i.e., from pairs of ungapped segments of the input sequences. Given a set F of candidate fragments and a weighting function w : F + FL:, the score of an alignment is de

An Algorithm for Finding the K-Best Allo
An Algorithm for Finding the K-Best Allocations of a Tree Structured Program
โœ A. Billionnet; S. Elloumi ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 592 KB

We consider the problem of allocating \(n\) tasks of a distributed program to \(m\) processors of a distributed system in order to minimize total communication and processing costs. If the intertask communication can be represented by a tree and if the communication costs are uniform, it is known th

An efficient and derivative-free algorit
An efficient and derivative-free algorithm for finding the minimum of a 1-D user-defined function
โœ F.X. Yu; V.P. Singh ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 634 KB

An efficient algorithm was developed for finding the minimum or maximum of a one-dimensional (I-D) user-defined function. The algorithm combined the quadratic interpolation, the Golden search, and an additional side search into a unified optimal search. Five I-D, four 2-D, and two 4-D functions were