Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Beam search for the longest common subsequence problem

Autor
Blum, C.; Blesa, M.; López, M.
Tipus d'activitat
Document cientificotècnic
Data
2008-10
Codi
LSI-08-29-R
Repositori
http://hdl.handle.net/2117/86874 Obrir en finestra nova
Resum
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 ap...
Citació
Blum, C., Blesa, M., López, M. "Beam search for the longest common subsequence problem". 2008.
Paraules clau
Beam Search, Longest Common Subsequence
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants

Arxius