RNA Secondary Structure Prediction using Ant Colony Optimisation

نویسنده

  • Neil McMillan
چکیده

It is important to know the secondary structure of RNA for applications such as drug development and modelling single stranded viruses. Predictive methods have various degrees of accuracy but are significantly faster and cheaper than empirical methods such as X-ray crystallography. This project explores how Ant Colony Optimisation (ACO) performs on the task of RNA secondary structure prediction (RNASSP). An ant colony system is developed and experiments are conducted to examine its behaviour on this problem and to determine a good set of parameters. The performance and accuracy of this approach is then compared with alternative methods. The main findings are that whilst the accuracy of ACO is as good as dynamic programming for small sequences it is significantly slower to execute. For longer sequences both slower and less accurate than dynamic programming.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem

The prediction of a protein’s structure from its amino-acid sequence is one of the most important problems in computational biology. In the current work, we focus on a widely studied abstraction of this problem, the 2-dimensional hydrophobic-polar (2D HP) protein folding problem. We present an improved version of our recently proposed Ant Colony Optimisation (ACO) algorithm for this -hard combi...

متن کامل

Niching for Ant Colony Optimisation

Evolutionary Computation niching methods, such as Fitness Sharing and Crowding, are aimed at simultaneously locating and maintaining multiple optima to increase search robustness, typically in multi-modal function optimization. Such methods have been shown to be useful for both single and multiple objective optimisation problems. Niching methods have been adapted in recent years for other optim...

متن کامل

New Ant Colony Optimisation Algorithms for Hierarchical Classification of Protein Functions

Ant colony optimisation (ACO) is a metaheuristic to solve optimisation problems inspired by the foraging behaviour of ant colonies. It has been successfully applied to several types of optimisation problems, such as scheduling and routing, and more recently for the discovery of classification rules. The classification task in data mining aims at predicting the value of a given goal attribute fo...

متن کامل

Artificial Ant Colonies and E-Learning: An Optimisation of Pedagogical Paths

This paper describes current research on the optimisation of the pedagogical path of a student in an existing e-learning software. This optimisation is performed following the models given by a fairly recent field of Artificial Intelligence: Ant Colony Optimisation (ACO) [1,2,4]. The underlying structure of the E-learning material is represented by a graph with valued arcs whose weights are opt...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006