An evolutionary algorithm for gene structure prediction

  • Authors:
  • Javier Pérez-Rodríguez;Nicolás García-Pedrajas

  • Affiliations:
  • Department of Computing and Numerical Analysis, University of Córdoba, Spain;Department of Computing and Numerical Analysis, University of Córdoba, Spain

  • Venue:
  • IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Gene recognition, gene structure prediction or gene finding, as all these three and other terms are used, consists of determining which parts of a genomic sequence are coding, and constructing the whole gene from its start site to its stop codon. Gene recognition is one of the most important open problems in Bioinformatics. The process of discovering the putative genes in a genome is called annotation. There are two basic approaches to gene structure prediction: extrinsic and intrinsic methods. Intrinsic methods are now preferred due to their ability to identify more unknown genes. Gene recognition is a search problem, where many evidence sources are combined in a scoring function that must be maximized to obtain the structure of a probable gene. In this paper, we propose the first purely evolutionary algorithm in the literature for gene structure prediction. The application of genetic algorithms to gene recognition will open a new field of research where the flexibility of evolutionary computation can be used to account for the complexities of the problem, which are growing as our knowledge of the molecular processes of transcription and translation deepens.