A hyper-heuristic for the longest common subsequence problem
DOI10.1016/J.COMPBIOLCHEM.2011.12.004zbMATH Open1244.92021OpenAlexW1973269778WikidataQ45180431 ScholiaQ45180431MaRDI QIDQ441749FDOQ441749
Authors: Farzaneh Sadat Tabataba, Sayyed Rasoul Mousavi 
Publication date: 7 August 2012
Published in: Computational Biology and Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.compbiolchem.2011.12.004
Recommendations
- An improved algorithm for the longest common subsequence problem
- Beam search for the longest common subsequence problem
- A large neighborhood search heuristic for the longest common subsequence problem
- Analysis of evolutionary algorithms for the longest common subsequence problem
- On solving a generalized constrained longest common subsequence problem
Complexity and performance of numerical algorithms (65Y20) Biochemistry, molecular biology (92C40) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational methods for problems pertaining to biology (92-08)
Cites Work
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- A linear space algorithm for computing maximal common subsequences
- Title not available (Why is that?)
- The Complexity of Some Problems on Subsequences and Supersequences
- Computing a longest common subsequence for a set of strings
- On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
- Beam search for the longest common subsequence problem
- Finding the longest common subsequence for multiple biological sequences by ant colony optimization
- Performance analysis of some simple heuristics for computing longest common subsequences
- An improved algorithm for the longest common subsequence problem
- Deposition and extension approach to find longest common subsequence for thousands of long sequences
- A specialized branching and fathoming technique for the longest common subsequence problem
- Sparse dynamic programming II
- Probabilistic Beam Search for the Longest Common Subsequence Problem
- A large neighborhood search heuristic for the longest common subsequence problem
Cited In (11)
- Improved heuristics and a genetic algorithm for finding short supersequences
- Dynamic programming algorithms for the mosaic longest common subsequence problem
- Solving longest common subsequence problems via a transformation to the maximum clique problem
- Finding the longest common subsequence for multiple biological sequences by ant colony optimization
- Title not available (Why is that?)
- Unified encoding for hyper-heuristics with application to bioinformatics
- On the role of metaheuristic optimization in bioinformatics
- An improved algorithm for the longest common subsequence problem
- A learning algorithm for the longest common subsequence problem
- Thermodynamical approach to the longest common subsequence problem
- Constrained sequence analysis algorithms in computational biology
Uses Software
This page was built for publication: A hyper-heuristic 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 Q441749)
