Skip to main content
. 2007 Aug 31;8:323. doi: 10.1186/1471-2105-8-323

Figure 6.

Figure 6

Flowchart of the optimization procedure using genetic algorithm. It starts with the initialization phase, which randomly generates the initial population P0. Population in the next generation Pi+1 is obtained by applying genetic operators on current population Pi. Fitness for each individual (criterion) is evaluated as the number of filtered peptides. Evolution continues until a terminating condition is reached. The selection, mutation and cross-over operator are used in genetic algorithm.