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...
| Autores: | , , |
|---|---|
| Tipo de documento: | relatório científico |
| Data de publicação: | 2008 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositório: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglês |
| OAI Identifier: | oai:upcommons.upc.edu:2117/86874 |
| Acesso em linha: | https://hdl.handle.net/2117/86874 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Beam search Longest common subsequence Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Resumo: | 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. |
|---|