Multiple Sequence Alignment Using a Genetic Algorithm
Masamichi Isokawa, Masato Wayama, Toshio Shimizu · 1996
The conventional multiple sequence alignment algorithms are classi ed into two categories: iterative improvement strategies (e.g., [1]) and simulated annealing methods (e.g., [6]). Recently, a genetic algorithm has been used in computational molecular biology as a powerful combinatorial optimizer. A genetic algorithm has been applied to the problem of multiple sequence alignment on a parallel