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

Solving the multiple sequence alignment problem based on simulated annealing algorithm

โœ Scribed by Liang Shuang; Mo Zhong-xi

Publisher
Wuhan University
Year
2002
Tongue
English
Weight
48 KB
Volume
7
Category
Article
ISSN
1007-1202

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Multiple sequence alignment algorithm ba
Multiple sequence alignment algorithm based on a dispersion graph and ant colony algorithm
โœ 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