Probabilistic Beam Search for the Longest Common Subsequence Problem

DOI10.1007/978-3-540-74446-7_11MaRDI QIDQ5429296zbMATH OpenOpenAlexFDO

Authors Christian Blum, Maria J. Blesa

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)

Recommendations

• Beam search for the longest common subsequence problem
• An improved algorithm for the longest common subsequence problem
• Beam-ACO for the repetition-free longest common subsequence problem
• On solving a generalized constrained longest common subsequence problem
• A large neighborhood search heuristic for the longest common subsequence problem

Cited in

(9)

• An improved algorithm for the longest common subsequence problem
• A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem
• A beam search for the shortest common supersequence problem guided by an approximate expected length calculation
• Deposition and extension approach to find longest common subsequence for thousands of long sequences
• A hyper-heuristic for the longest common subsequence problem
• scientific article; zbMATH DE number 5873671 (Why is no real title available?)
• Beam-ACO for the repetition-free longest common subsequence problem
• Generic machine-learning-augmented beam search for resource-constrained shortest path reformulations of combinatorial optimization problems
• Beam search for the longest common subsequence problem

This page was built for publication: Probabilistic Beam Search for the Longest Common Subsequence Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429296)