Figure 5.

Output of the genetic algorithm showing convergence to anchor sequence. Starting from a completely random sequence, the genetic algorithm is able to converge to a sequence that is a substring of the full anchor sequence. (a) The fitness progression of one of the runs of the genetic algorithm. The genetic algorithm searches in the space of all possible sequences to converge to a high fitness sequence that matches the anchor sequence. (b) The evolution of the estimated anchor sequence at each iteration of the genetic algorithm. The output converges to a substring of the actual anchor sequence, namely AAAUUGAAAACUGCCUGAAUGUUGGGAUAGGGUACUCGACAA.

Anastassiou et al. Genome Biology 2006 7:R2   doi:10.1186/gb-2006-7-1-r2
Download authors' original image