An improved algorithm for the longest common subsequence problem

DOI10.1016/J.COR.2011.02.026zbMATH Open1251.90395OpenAlexW2084652256MaRDI QIDQ1762001FDOQ1762001

Authors: Sayyed Rasoul Mousavi, Farzaneh Sadat Tabataba 

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.02.026

Recommendations

• A hyper-heuristic for the longest common subsequence problem
• Beam search for the longest common subsequence problem
• On solving a generalized constrained longest common subsequence problem
• Publication:4862293
• Probabilistic Beam Search for the Longest Common Subsequence Problem

zbMATH Keywords

algorithmsbioinformaticslongest common subsequencebeam searchLCSheuristic function

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Cites Work

• Title not available (Why is that?)
• 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
• 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 (14)

• An interactive dynamic approach based on hybrid swarm optimization for solving multiobjective programming problem with fuzzy parameters
• Beam search for the longest common subsequence problem
• Finding the longest common subsequence for multiple biological sequences by ant colony optimization
• A CGM Algorithm Solving the Longest Increasing Subsequence Problem
• Probabilistic Beam Search for the Longest Common Subsequence Problem
• A hyper-heuristic for the longest common subsequence problem
• On the role of metaheuristic optimization in bioinformatics
• A large neighborhood search heuristic for the longest common subsequence problem
• Anytime algorithms for the longest common palindromic subsequence problem
• Improved approaches to solve the one-to-one skewgram problem
• A specialized branching and fathoming technique for the longest common subsequence problem
• A learning algorithm for the longest common subsequence problem
• A diagonal-based algorithm for the longest common increasing subsequence problem
• Constrained sequence analysis algorithms in computational biology

This page was built for publication: An improved algorithm 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 Q1762001)