A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem

This paper deals with an NP-hard string problem from the bio-informatics field: the repetition-free longest common subsequence problem. This problem has enjoyed an increasing interest in recent years, which has resulted in the application of several pure as well as hybrid metaheuristics. However, th...

Full description

Bibliographic Details
Authors: Blum, Christian, Blesa Aguilera, Maria Josep|||0000-0001-8246-9926
Format: article
Publication Date:2018
Country:España
Institution:Universitat Politècnica de Catalunya (UPC)
Repository:UPCommons. Portal del coneixement obert de la UPC
Language:English
OAI Identifier:oai:upcommons.upc.edu:2117/118970
Online Access:https://hdl.handle.net/2117/118970
https://dx.doi.org/10.1007/s10732-017-9329-x
Access Level:Open access
Keyword:Heuristic algorithms
Repetition-free longest common subsequence
Hybrid metaheuristics
Matheuristic
Heurística
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
id ES_153658aedad219d02e2aa9ce77cf05d0
oai_identifier_str oai:upcommons.upc.edu:2117/118970
network_acronym_str ES
network_name_str España
repository_id_str
spelling A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problemBlum, ChristianBlesa Aguilera, Maria Josep|||0000-0001-8246-9926Heuristic algorithmsRepetition-free longest common subsequenceHybrid metaheuristicsMatheuristicHeurísticaÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitatThis paper deals with an NP-hard string problem from the bio-informatics field: the repetition-free longest common subsequence problem. This problem has enjoyed an increasing interest in recent years, which has resulted in the application of several pure as well as hybrid metaheuristics. However, the literature lacks a comprehensive comparison between those approaches. Moreover, it has been shown that general purpose integer linear programming solvers are very efficient for solving many of the problem instances that were used so far in the literature. Therefore, in this work we extend the available benchmark set, adding larger instances to which integer linear programming solvers cannot be applied anymore. Moreover, we provide a comprehensive comparison of the approaches found in the literature. Based on the results we propose a hybrid between two of the best methods which turns out to inherit the complementary strengths of both methods.Peer Reviewed20182018-06-0120182018-07-05journal articlehttp://purl.org/coar/resource_type/c_6501AMhttp://purl.org/coar/version/c_ab4af688f83e57aainfo:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/2117/118970https://dx.doi.org/10.1007/s10732-017-9329-xreponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/1189702026-05-27T15:37:01Z
dc.title.none.fl_str_mv A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem
title A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem
spellingShingle A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem
Blum, Christian
Heuristic algorithms
Repetition-free longest common subsequence
Hybrid metaheuristics
Matheuristic
Heurística
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
title_short A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem
title_full A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem
title_fullStr A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem
title_full_unstemmed A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem
title_sort A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem
dc.creator.none.fl_str_mv Blum, Christian
Blesa Aguilera, Maria Josep|||0000-0001-8246-9926
author Blum, Christian
author_facet Blum, Christian
Blesa Aguilera, Maria Josep|||0000-0001-8246-9926
author_role author
author2 Blesa Aguilera, Maria Josep|||0000-0001-8246-9926
author2_role author
dc.subject.none.fl_str_mv Heuristic algorithms
Repetition-free longest common subsequence
Hybrid metaheuristics
Matheuristic
Heurística
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
topic Heuristic algorithms
Repetition-free longest common subsequence
Hybrid metaheuristics
Matheuristic
Heurística
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
description This paper deals with an NP-hard string problem from the bio-informatics field: the repetition-free longest common subsequence problem. This problem has enjoyed an increasing interest in recent years, which has resulted in the application of several pure as well as hybrid metaheuristics. However, the literature lacks a comprehensive comparison between those approaches. Moreover, it has been shown that general purpose integer linear programming solvers are very efficient for solving many of the problem instances that were used so far in the literature. Therefore, in this work we extend the available benchmark set, adding larger instances to which integer linear programming solvers cannot be applied anymore. Moreover, we provide a comprehensive comparison of the approaches found in the literature. Based on the results we propose a hybrid between two of the best methods which turns out to inherit the complementary strengths of both methods.
publishDate 2018
dc.date.none.fl_str_mv 2018
2018-06-01
2018
2018-07-05
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
AM
http://purl.org/coar/version/c_ab4af688f83e57aa
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/118970
https://dx.doi.org/10.1007/s10732-017-9329-x
url https://hdl.handle.net/2117/118970
https://dx.doi.org/10.1007/s10732-017-9329-x
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869403783225671680
score 15,228081

Similar Items