Beam search for the longest common subsequence problem

The longest common subsequence problem is a classical string problem that concerns finding the common part of a set of strings. It has several important applications, for example, pattern recognition or computational biology. Most research efforts up to now have focused on solving this problem optim...

Descripción completa

Detalles Bibliográficos
Autores: Blum, Christian, Blesa Aguilera, Maria Josep|||0000-0001-8246-9926, López Ibañez, Manuel
Tipo de recurso: informe técnico
Fecha de publicación:2008
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/86874
Acceso en línea:https://hdl.handle.net/2117/86874
Access Level:acceso abierto
Palabra clave:Beam search
Longest common subsequence
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
id ES_81c32a4822efb8cf41e621fe7e4d27a8
oai_identifier_str oai:upcommons.upc.edu:2117/86874
network_acronym_str ES
network_name_str España
repository_id_str
spelling Beam search for the longest common subsequence problemBlum, ChristianBlesa Aguilera, Maria Josep|||0000-0001-8246-9926López Ibañez, ManuelBeam searchLongest common subsequenceÀrees temàtiques de la UPC::Informàtica::Informàtica teòricaThe longest common subsequence problem is a classical string problem that concerns finding the common part of a set of strings. It has several important applications, for example, pattern recognition or computational biology. Most research efforts up to now have focused on solving this problem optimally. In comparison, only few works exist dealing with heuristic approaches. In this work we present a deterministic beam search algorithm. The results show that our algorithm outperforms classical approaches as well as recent metaheuristic approaches.20082008-10-0120162016-05-10reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/pdfhttps://hdl.handle.net/2117/86874reponame: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/868742026-05-27T15:37:01Z
dc.title.none.fl_str_mv Beam search for the longest common subsequence problem
title Beam search for the longest common subsequence problem
spellingShingle Beam search for the longest common subsequence problem
Blum, Christian
Beam search
Longest common subsequence
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
title_short Beam search for the longest common subsequence problem
title_full Beam search for the longest common subsequence problem
title_fullStr Beam search for the longest common subsequence problem
title_full_unstemmed Beam search for the longest common subsequence problem
title_sort Beam search for the longest common subsequence problem
dc.creator.none.fl_str_mv Blum, Christian
Blesa Aguilera, Maria Josep|||0000-0001-8246-9926
López Ibañez, Manuel
author Blum, Christian
author_facet Blum, Christian
Blesa Aguilera, Maria Josep|||0000-0001-8246-9926
López Ibañez, Manuel
author_role author
author2 Blesa Aguilera, Maria Josep|||0000-0001-8246-9926
López Ibañez, Manuel
author2_role author
author
dc.subject.none.fl_str_mv Beam search
Longest common subsequence
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
topic Beam search
Longest common subsequence
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
description The longest common subsequence problem is a classical string problem that concerns finding the common part of a set of strings. It has several important applications, for example, pattern recognition or computational biology. Most research efforts up to now have focused on solving this problem optimally. In comparison, only few works exist dealing with heuristic approaches. In this work we present a deterministic beam search algorithm. The results show that our algorithm outperforms classical approaches as well as recent metaheuristic approaches.
publishDate 2008
dc.date.none.fl_str_mv 2008
2008-10-01
2016
2016-05-10
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/86874
url https://hdl.handle.net/2117/86874
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_ 1869411997326508032
score 15.228081

Similares en LA Referencia