A large neighborhood search heuristic for the longest common subsequence problem
From MaRDI portal
Publication:953288
DOI10.1007/s10732-007-9038-yzbMath1211.90302OpenAlexW1981915844MaRDI QIDQ953288
Abhilash Singireddy, Todd Easton
Publication date: 17 November 2008
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-007-9038-y
Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)
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 policy-based learning beam search for combinatorial optimization ⋮ A hyper-heuristic for the longest common subsequence problem ⋮ An improved algorithm for the longest common subsequence problem ⋮ Anytime algorithms for the longest common palindromic subsequence problem ⋮ A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of very large-scale neighborhood search techniques
- Computing a longest common subsequence for a set of strings
- On finding minimal length superstrings
- The string merging problem
- Performance analysis of some simple heuristics for computing longest common subsequences
- An Automatic Method of Solving Discrete Programming Problems
- A linear space algorithm for computing maximal common subsequences
- A fast algorithm for computing longest common subsequences
- The Complexity of Some Problems on Subsequences and Supersequences
- A Sentence-to-Sentence Clustering Procedure for Pattern Analysis
- Algorithms for the Longest Common Subsequence Problem
- Sparse dynamic programming II
- On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
