Finding the longest common subsequence for multiple biological sequences by ant colony optimization
type: Item
instance of: scholarly article
title: Finding the longest common subsequence for multiple biological sequences by ant colony optimization
zbMATH Open document ID: 1176.90515
author: Shyong Jian Shyu
author: Chun-Yuan Tsai
published in: Computers \& Operations Research
publication date: 2008-10-08T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5349735
zbMATH Keywords: meta-heuristics
MaRDI profile type: Publication
full work available at URL: j.cor.2007.07.006
OpenAlex ID: W2022001484
cites work: The String-to-String Correction Problem
cites work: Algorithms on Strings, Trees and Sequences
cites work: Algorithms for the Longest Common Subsequence Problem
cites work: A faster algorithm computing string edit distances
cites work: The longest common subsequence problem revisited
cites work: A learning algorithm for the longest common subsequence problem
cites work: The Complexity of Some Problems on Subsequences and Supersequences
cites work: Q4198056
cites work: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
cites work: An ant colony optimization algorithm for the minimum weight vertex cover problem
cites work: Ant colony optimization for the cell assignment problem in PCS networks
DOI: 10.1016/J.COR.2007.07.006
description: scientific article; zbMATH DE number 5349735