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

Born approximation for collisional alignment

โœ Scribed by R.F. Snider

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
818 KB
Volume
137
Category
Article
ISSN
0378-4371

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Approximation algorithms for multiple se
Approximation algorithms for multiple sequence alignment
โœ Vineet Bafna; Eugene L. Lawler; Pavel A. Pevzner ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 793 KB

We consider the problem of aligning of k sequences of length n. The cost function is sum of pairs, and satisfies triangle inequality. Earlier results on finding approximation algorithms for this problem are due to Gusfield (1991) who achieved an approximation ratio of 2 -2/k, and Pevzner (1992) who