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

A genetic algorithm on multiple sequences alignment problems in biology

โœ Scribed by Shi Feng; Huang Jing; Mo Zhong-xi; Zheng Hui-rao

Publisher
Wuhan University
Year
2002
Tongue
English
Weight
422 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

Automatic Discovery of Sub-molecular Seq
Automatic Discovery of Sub-molecular Sequence Domains in Multi-aligned Sequences: A Dynamic Programming Algorithm for Multiple Alignment Segmentation
โœ 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

A genetic algorithm for sequencing type
A genetic algorithm for sequencing type problems in engineering design
โœ Min-Wei Huang; Ching C. Hsieh; Jasbir S. Arora ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 165 KB ๐Ÿ‘ 1 views

A genetic algorithm for engineering applications that involve sequencing of operations is proposed and demonstrated. Such applications are known as travelling salesman problems in operations research literature. The proposed algorithm uses some new operators that are different from those typically u

A network parallel genetic algorithm for
A network parallel genetic algorithm for the one machine sequencing problem
โœ M.K. Mayer ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 626 KB

This paper presents a network parallel genetic algorithm for the one machine sequencing problem. It examines a parallel genetic algorithm in which processors exchange their best solution found at periodic intervals and the case when no exchange is performed. The network parallel genetic algorithm is