A hyper-heuristic for the longest common subsequence problem

DOI10.1016/j.compbiolchem.2011.12.004zbMath1244.92021OpenAlexW1973269778WikidataQ45180431 ScholiaQ45180431MaRDI QIDQ441749

Sayyed Rasoul Mousavi, Farzaneh Sadat Tabataba

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

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Complexity and performance of numerical algorithms (65Y20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational methods for problems pertaining to biology (92-08)

Related Items (2)

On the role of metaheuristic optimization in bioinformatics ⋮ Constrained sequence analysis algorithms in computational biology

Uses Software

• Hyperheuristics
• Pfam

Cites Work

• Unnamed Item
• Unnamed Item
• Computing a longest common subsequence for a set of strings
• Beam search for the longest common subsequence problem
• Finding the longest common subsequence for multiple biological sequences by ant colony optimization
• A large neighborhood search heuristic for the longest common subsequence problem
• 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 linear space algorithm for computing maximal common subsequences
• The Complexity of Some Problems on Subsequences and Supersequences
• Sparse dynamic programming II
• Hyper-Heuristics: An Emerging Direction in Modern Search Technology
• On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
• Probabilistic Beam Search for the Longest Common Subsequence Problem

This page was built for publication: A hyper-heuristic for the longest common subsequence problem