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.
%0 Book Section
%1 Chaabane_2020
%A Chaabane, Lamiche
%A Khelassi, Abdeldjalil
%A Terziev, Andrey
%A Andreopoulos, Nikolaos
%A de Jesus, M. A.
%A Estrela, Vania Vieira
%B Advances in Multidisciplinary Medical Technologies â Engineering, Modeling and Findings
%D 2020
%I Springer International Publishing
%K PSO Tabu_search biomedical_engineering imported myown pattern_recognition sequence_alignment
%P 103--114
%R 10.1007/978-3-030-57552-6_8
%T Particle Swarm Optimization with Tabu Search Algorithm (PSO-TS) Applied to Multiple Sequence Alignment Problem
%U https://doi.org/10.1007%2F978-3-030-57552-6_8
%X 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.
@incollection{Chaabane_2020,
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.},
added-at = {2021-04-21T11:45:34.000+0200},
author = {Chaabane, Lamiche and Khelassi, Abdeldjalil and Terziev, Andrey and Andreopoulos, Nikolaos and de Jesus, M. A. and Estrela, Vania Vieira},
biburl = {https://www.bibsonomy.org/bibtex/283c7ca2cd84db3ac158c6e8285b8ff48/vaniave},
booktitle = {Advances in Multidisciplinary Medical Technologies â Engineering, Modeling and Findings},
doi = {10.1007/978-3-030-57552-6_8},
interhash = {2c4216d2d2a714d22ac30b50ac0e2a35},
intrahash = {83c7ca2cd84db3ac158c6e8285b8ff48},
keywords = {PSO Tabu_search biomedical_engineering imported myown pattern_recognition sequence_alignment},
language = {English},
month = nov,
pages = {103--114},
publisher = {Springer International Publishing},
timestamp = {2021-05-17T22:22:59.000+0200},
title = {Particle Swarm Optimization with Tabu Search Algorithm ({PSO}-{TS}) Applied to Multiple Sequence Alignment Problem},
type = {Publication},
url = {https://doi.org/10.1007%2F978-3-030-57552-6_8},
year = 2020
}