Algorithmic properties of ciliate sequence alignment
โ Scribed by J. Mark Keil; Jing Liu; Ian McQuillan
- Book ID
- 108281601
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 635 KB
- Volume
- 411
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
## 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,
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