Aligning multiple sequences by genetic algorithm

The paper presents a genetic algorithm for solving multiple sequence alignment in bioinformatics. The algorithm involves four different operators, one type of selection operator, two types of crossover operators, and one type of mutation operator; the mutation operator is realized by a dynamic programming method. Experimental results of benchmarks from the BAliBASE show that the proposed algorithm is feasible for aligning equidistant protein sequences, and the quality of alignment is comparable to that obtained with ClustalX.