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

Algorithms for path-constrained sequence alignment

โœ Scribed by Pinhas, Tamar; Milo, Nimrod; Kucherov, Gregory; Ziv-Ukelson, Michal

Book ID
121887458
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
326 KB
Volume
24
Category
Article
ISSN
1570-8667

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

A Path Algorithm for Constrained Estimat
A Path Algorithm for Constrained Estimation
โœ Zhou, Hua; Lange, Kenneth ๐Ÿ“‚ Article ๐Ÿ“… 2013 ๐Ÿ› American Statistical Association ๐ŸŒ English โš– 380 KB
Parametric and ensemble sequence alignme
Parametric and ensemble sequence alignment algorithms
โœ Michael S. Waterman ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Springer ๐ŸŒ English โš– 1020 KB

## Proceedings of the Third Annual ACM-SIAM Discrete Algorithms) find optimal scores for all penalty parameters, both for global and local sequence alignment. This paper reviews those techniques Then in the main part of this paper dynamic programming methods are used to compute ensemble alignment,