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

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


Approximation algorithms for multiple se
โœ 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

Multiple sequence alignment algorithm ba
โœ Weiyang Chen; Bo Liao; Wen Zhu; Xuyu Xiang ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 213 KB

## 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 Discovery of Sub-molecular Seq
โœ ERIC POE XING; DENISE M. WOLF; INNA DUBCHAK; SYLVIA SPENGLER; MANFRED ZORN; ILYA ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 446 KB

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