Application with a hybrid ant colony optimisation in motif detecting problem

Authors:
Yi Zhang;Meng Zhang;Zhili Pei
Affiliations:
Department of Computer Science, Jilin Business and Technology College, Changchun 130062, China/ Military Simulation Technology Institute, Air Force Aviation University, Changchun 130022, China.;College of Computer Science and Technology, Jilin University, Changchun 130012, China/ Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, ...;College of Computer Science and Technology, Inner Mongolia University for the Nationalities, Tongliao 028000, China/ College of Mathematics, Jilin University, Changchun 130012, China
Venue:
International Journal of Computer Applications in Technology
Year:
2012

Citing 6
Cited 2

A Study of Some Properties of Ant-Q

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem

INFORMS Journal on Computing
An Ant Colony System Hybridized with Randomized Algorithm for TSP

SNPD '07 Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Data mining with an ant colony optimization algorithm

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Domain information based prediction of protein-protein interactions of glucosinolate biosynthesis

International Journal of Computer Applications in Technology
A genetic ant colony algorithm for routing in CPS heterogeneous network

International Journal of Computer Applications in Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a hybrid optimisation algorithm for the motif detection problem of biological sequences is presented. Our method is improved Gibbs sampling method by employing an improved ant colony optimisation (ACO) algorithm. The goal of our method is to reduce the required computing time and get better solution. First, we find a set of better candidate positions for revising the motif by using an improved ACO. Then we use these candidate positions as the input to the Gibbs sampling method. The simulation results show that by employing our improved algorithm, both efficiency and quality for detecting motifs are improved compared with simple Gibbs sampling method.