An improved algorithm for the longest common subsequence problem
type: Item
instance of: scholarly article
title: An improved algorithm for the longest common subsequence problem
zbMATH Open document ID: 1251.90395
author: Sayyed Rasoul Mousavi
author: Farzaneh Sadat Tabataba
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 92D20
zbMATH DE Number: 6107484
zbMATH Keywords: longest common subsequence
zbMATH Keywords: LCS
zbMATH Keywords: beam search
zbMATH Keywords: heuristic function
zbMATH Keywords: algorithms
zbMATH Keywords: bioinformatics
MaRDI profile type: Publication
full work available at URL: j.cor.2011.02.026
OpenAlex ID: W2084652256
cites work: Q3948568
cites work: The Complexity of Some Problems on Subsequences and Supersequences
cites work: Q4198056
cites work: A linear space algorithm for computing maximal common subsequences
cites work: Sparse dynamic programming II
cites work: Computing a longest common subsequence for a set of strings
cites work: Q3517653
cites work: Performance analysis of some simple heuristics for computing longest common subsequences
cites work: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
cites work: Finding the longest common subsequence for multiple biological sequences by ant colony optimization
cites work: A large neighborhood search heuristic for the longest common subsequence problem
cites work: Beam search for the longest common subsequence problem
cites work: Probabilistic Beam Search for the Longest Common Subsequence Problem
DOI: 10.1016/J.COR.2011.02.026
description: scientific article; zbMATH DE number 6107484