Abstract
In the bioinformatics realm, multiple sequence alignment (MSA) is an NP-hard problem. Nature-inspired methodologies configure potent tools to outsmart conventional optimization tactics to encounter an approximate solution for MSA. This investigatory work brings in a novel hybrid algorithm termed PSO-TS for solving the MSA problem. The PSO-TS employs the particle swarm optimization (PSO) procedure to explore the search space better, but the local optimum limit may hinder it. For that, the tabu search (TS) procedure ameliorates the global best solution quality. Numerical experimental outcomes on some BaliBASE benchmark instances confirmed the capability of the PSO-TS approach to producing better by-products while comparing it to other established literary works.
Users
Please
log in to take part in the discussion (add own reviews or comments).