A hyper-heuristic for the longest common subsequence problem

DOI10.1016/J.COMPBIOLCHEM.2011.12.004MaRDI QIDQ441749zbMATH OpenOpenAlexWikidataFDO

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

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3767009 (Why is no real title available?)
• A large neighborhood search heuristic for the longest common subsequence problem
• A linear space algorithm for computing maximal common subsequences
• A specialized branching and fathoming technique for the longest common subsequence problem
• An improved algorithm for the longest common subsequence problem
• Beam search for the longest common subsequence problem
• Computing a longest common subsequence for a set of strings
• Deposition and extension approach to find longest common subsequence for thousands of long sequences
• Finding the longest common subsequence for multiple biological sequences by ant colony optimization
• Hyper-Heuristics: An Emerging Direction in Modern Search Technology
• On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
• Performance analysis of some simple heuristics for computing longest common subsequences
• Probabilistic Beam Search for the Longest Common Subsequence Problem
• Sparse dynamic programming II
• The Complexity of Some Problems on Subsequences and Supersequences

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
• Unified encoding for hyper-heuristics with application to bioinformatics
• scientific article; zbMATH DE number 5545474 (Why is no real title available?)
• 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

Describes a project that uses

Uses Software

• Pfam
• Hyperheuristics

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)