Gomes, Vitoria Zanon [UNESP]Andrade, Matheus Carreira [UNESP]Amorim, Anderson Rici [UNESP]Zafalon, Geraldo Francisco Donega [UNESP]Filipe, J.Smialek, M.Brodsky, A.Hammoudi, S.2022-11-302022-11-302022-01-01Iceis: Proceedings Of The 24th International Conference On Enterprise Information Systems - Vol 2. Setubal: Scitepress, p. 167-174, 2022.http://hdl.handle.net/11449/237766The multiple sequence alignment is one of the most important tasks in bioinformatics, since it allows to analyze multiple sequences at the same time. There are many approaches for this problem such as heuristics and metaheuristics, that generally lead to great results in a plausible time, being among the most used approaches. The genetic algorithm is one of the most used methods because of its results quality, but it had a problematic disadvantage: it can be easily trapped in a local optima result, not being able to reach better alignments. In this work we propose a hybrid genetic algorithm with progressive and consistency-based methods as a way to smooth the local optima problem and improve the quality of the alignments. The obtained results show that our method was able to improve the quality of AG results 2 a 27 times, smoothing the local maximum problem and providing results with more biological significance.167-174engBioinformaticsMultiple Sequence AlignmentGenetic AlgorithmHybrid Multiple Sequence AlignmentTrabalho apresentado em evento10.5220/0011082900003179WOS:000814767900018