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

Parametric and ensemble sequence alignment algorithms

โœ Scribed by Michael S. Waterman

Publisher
Springer
Year
1994
Tongue
English
Weight
1020 KB
Volume
56
Category
Article
ISSN
1522-9602

No coin nor oath required. For personal study only.

โœฆ Synopsis

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, finding all alignment scores for all parameters. Both global and local ensemble alignments are studied, and parametric alignment is used to compute near optimal ensemble alignments.

๐Ÿ“œ 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

Large-scale comparison of protein sequen
Large-scale comparison of protein sequence alignment algorithms with structure alignments
โœ J. Michael Sauder; Jonathan W. Arthur; Roland L. Dunbrack Jr. ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 288 KB ๐Ÿ‘ 2 views

Sequence alignment programs such as BLAST and PSI-BLAST are used routinely in pairwise, profile-based, or intermediate-sequencesearch (ISS) methods to detect remote homologies for the purposes of fold assignment and comparative modeling. Yet, the sequence alignment quality of these methods at low se