An Opposition-Based Learning CRO Algorithm for Solving the Shortest Common Supersequence Problem

As a non-deterministic polynomial hard (NP-hard) problem, the shortest common supersequence (SCS) problem is normally solved by heuristic or metaheuristic algorithms. One type of metaheuristic algorithms that has relatively good performance for solving SCS problems is the chemical reaction optimizat...

Descripción completa

Detalles Bibliográficos
Autores principales: Luo, Fei, Chen, Cheng, Fuentes, Joel, Li, Yong, Ding, Weichao
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2022
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9141143/
https://www.ncbi.nlm.nih.gov/pubmed/35626526
http://dx.doi.org/10.3390/e24050641

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9141143/
https://www.ncbi.nlm.nih.gov/pubmed/35626526
http://dx.doi.org/10.3390/e24050641

Ejemplares similares