Show simple item record

dc.contributor.authorLozano, Manuel
dc.contributor.authorBlum, Christian
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.date.accessioned2011-02-21T08:33:47Z
dc.date.available2011-02-21T08:33:47Z
dc.date.created2010-10
dc.date.issued2010-10
dc.identifier.citationLozano, M.; Blum, C. A hybrid metaheuristic for the longest common subsequence problem. "Lecture notes in computer science", Octubre 2010, núm. 6373, p. 1-15.
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/2117/11436
dc.description.abstractThe longest common subsequence problem is a classical string problem. It has applications, for example, in pattern recognition and bioinformatics. This contribution proposes an integrative hybrid metaheuristic for this problem. More specifically, we propose a variable neighborhood search that applies an iterated greedy algorithm in the improvement phase and generates the starting solutions by invoking either beam search or a greedy randomized procedure. The main motivation of this work is the lack of fast neighborhood search methods for the tackled problem. The benefits of the proposal in comparison to the state of the art are experimentally shown.
dc.format.extent15 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
dc.subject.lcshLongest common subsequence problem
dc.subject.lcshLCS
dc.titleA hybrid metaheuristic for the longest common subsequence problem
dc.typeArticle
dc.subject.lemacProblema de la subseqüencia comuna mes llarga
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.identifier.doi10.1007/978-3-642-16054-7_1
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://www.springerlink.com/content/?k=A+Hybrid+Metaheuristic+for+the+Longest+Common+Subsequence+Problem
dc.rights.accessRestricted access - publisher's policy
local.identifier.drac4998720
dc.description.versionPostprint (published version)
local.citation.authorLozano, M.; Blum, C.
local.citation.publicationNameLecture notes in computer science
local.citation.number6373
local.citation.startingPage1
local.citation.endingPage15


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder