Beam search for the longest common subsequence problem
From MaRDI portal
Publication:833536
DOI10.1016/J.COR.2009.02.005zbMATH Open1175.90208OpenAlexW2071241868MaRDI QIDQ833536FDOQ833536
Authors: Christian Blum, Maria J. Blesa, Manuel López-Ibáñez 
Publication date: 14 August 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/86874
Recommendations
- Probabilistic 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 beam search for the shortest common supersequence problem guided by an approximate expected length calculation
Cites Work
- Ant colony optimization.
- Algorithms on Strings, Trees and Sequences
- Title not available (Why is that?)
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- Job shop scheduling with beam search
- The Complexity of Some Problems on Subsequences and Supersequences
- Improved lower bounds for the early/tardy scheduling problem with no idle time
- Computing a longest common subsequence for a set of strings
- On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
- Finding the longest common subsequence for multiple biological sequences by ant colony optimization
- Performance analysis of some simple heuristics for computing longest common subsequences
- A specialized branching and fathoming technique for the longest common subsequence problem
- Probabilistic Beam Search for the Longest Common Subsequence Problem
- A large neighborhood search heuristic for the longest common subsequence problem
- A Sentence-to-Sentence Clustering Procedure for Pattern Analysis
Cited In (18)
- An \(A^\ast\) search algorithm for the constrained 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
- Fast algorithms for computing the constrained LCS of run-length encoded strings
- Solving longest common subsequence problems via a transformation to the maximum clique problem
- Probabilistic Beam Search for the Longest Common Subsequence Problem
- A hyper-heuristic for the longest common subsequence problem
- An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints
- A large neighborhood search heuristic for the longest common subsequence problem
- Anytime algorithms for the longest common palindromic subsequence problem
- A neural network based guidance for a BRKGA: an application to the longest common square subsequence problem
- An improved algorithm for the longest common subsequence problem
- On solving the assembly line worker assignment and balancing problem via beam search
- Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion
- Beam-ACO for the repetition-free longest common subsequence problem
- Deposition and extension approach to find longest common subsequence for thousands of long sequences
- Incremental beam search
- Constrained sequence analysis algorithms in computational biology
This page was built for publication: 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 Q833536)
