Probabilistic Beam Search for the Longest Common Subsequence Problem

DOI10.1007/978-3-540-74446-7_11zbMath1134.68495OpenAlexW1563735945MaRDI QIDQ5429296

Maria J. Blesa, Christian Blum

Publication date: 29 November 2007

Published in: Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74446-7_11

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Deposition and extension approach to find longest common subsequence for thousands of long sequences ⋮ Beam search for the longest common subsequence problem ⋮ A beam search for the shortest common supersequence problem guided by an approximate expected length calculation ⋮ A hyper-heuristic for the longest common subsequence problem ⋮ An improved algorithm for the longest common subsequence problem ⋮ A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem