The Multiple Sequence Alignment problem is considered to be an NP-Hard problem, requiring initially a specific encoding schema and design, as for any other of its siblings, implement run the main categories heuristic. This paper intends discuss our proposed generic implementation Tabu Search algorithm, heuristic procedure by Fred Glover solve discrete combinatorial optimization problems. In thi...