A genetic algorithm for multiple sequence alignment
โ Scribed by Jorng-Tzong Horng; Li-Cheng Wu; Ching-Mei Lin; Bing-He Yang
- Publisher
- Springer
- Year
- 2004
- Tongue
- English
- Weight
- 571 KB
- Volume
- 9
- Category
- Article
- ISSN
- 1432-7643
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
## Abstract In this article, we describe a representation for the processes of multiple sequences alignment (MSA) and used it to solve the problem of MSA. By this representation, we took every possible aligning result into account by defining the representation of gap insertion, the value of heuris
Automatic identi"cation of sub-structures in multi-aligned sequences is of great importance for e!ective and objective structural/functional domain annotation, phylogenetic treeing and other molecular analyses. We present a segmentation algorithm that optimally partitions a given multi-alignment int