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

Multiple sequence alignment algorithm based on a dispersion graph and ant colony algorithm

โœ Scribed by Weiyang Chen; Bo Liao; Wen Zhu; Xuyu Xiang

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
213 KB
Volume
30
Category
Article
ISSN
0192-8651

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 heuristic information in every optional path and scoring rule. On the basis of the proposed multidimensional graph, we used the ant colony algorithm to find the better path that denotes a better aligning result. In our article, we proposed the instance of threeโ€dimensional graph and fourโ€dimensional graph and advanced a special ichnographic representation to analyze MSA. It is yet only an experimental software, and we gave an example for finding the best aligning result by threeโ€dimensional graph and ant colony algorithm. Experimental results show that our method can improve the solution quality on MSA benchmarks. ยฉ 2009 Wiley Periodicals, Inc. J Comput Chem 2009

๐Ÿ“œ SIMILAR VOLUMES

A block encryption algorithm based on dy
A block encryption algorithm based on dynamic sequences of multiple chaotic systems
โœ Xing-yuan Wang; Qing Yu ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 485 KB

A block encryption algorithm using dynamic sequences generated by multiple chaotic systems is proposed in this paper. In this algorithm, several one-dimension chaotic maps generate pseudo-random sequences, which are independent and approximately uniform. After a series of transformations, the sequen

Prediction of missense mutation function
Prediction of missense mutation functionality depends on both the algorithm and sequence alignment employed
โœ Stephanie Hicks; David A. Wheeler; Sharon E. Plon; Marek Kimmel ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 348 KB

Multiple algorithms are used to predict the impact of missense mutations on protein structure and function using algorithm-generated sequence alignments or manually curated alignments. We compared the accuracy with native alignment of SIFT, Align-GVGD, PolyPhen-2, and Xvar when generating functional

A framework for high-performance matrix
A framework for high-performance matrix multiplication based on hierarchical abstractions, algorithms and optimized low-level kernels
โœ Vinod Valsalam; Anthony Skjellum ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 385 KB

## Abstract Despite extensive research, optimal performance has not easily been available previously for matrix multiplication (especially for large matrices) on most architectures because of the lack of a structured approach and the limitations imposed by matrix storage formats. A simple but effec