Hard Problems in Gene Sequence Analysis: Classical Approaches and Suitability of Genetic Algorithms

ABSTRACT

Genetic algorithms are based on observations of natural phenomena as well as on the simulation of the artificial selection of organisms with multiple loci controlling a measurable trait. Genetic algorithms evolved into complex and strong informatics tools able to deal with hard problems of decision, classification, optimization, or/and simulation. We aimed to show how genetic algorithms can be used to solve hard problems on gene sequence analysis.

Keywords:

• gene sequence analysis
• genetic algorithm
• hard problem
• sequence alignment
• classification