Finding the longest common subsequence for multiple biological sequences by ant colony optimization

DOI10.1016/j.cor.2007.07.006zbMath1176.90515OpenAlexW2022001484MaRDI QIDQ947943

Shyong Jian Shyu, Chun-Yuan Tsai

Publication date: 8 October 2008

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

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

zbMATH Keywords

meta-heuristics

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (13)

Deposition and extension approach to find longest common subsequence for thousands of long sequences ⋮ Solving the minimum common string partition problem with the help of ants ⋮ Beam search for the longest common subsequence problem ⋮ Improved approaches to solve the one-to-one skewgram problem ⋮ A policy-based learning beam search for combinatorial optimization ⋮ Fast algorithms for computing the constrained LCS of run-length encoded strings ⋮ A hyper-heuristic for the longest common subsequence problem ⋮ An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints ⋮ Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion ⋮ Constrained sequence analysis algorithms in computational biology ⋮ An improved algorithm for the longest common subsequence problem ⋮ Anytime algorithms for the longest common palindromic subsequence problem ⋮ A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem

Cites Work

• Unnamed Item
• An ant colony optimization algorithm for the minimum weight vertex cover problem
• The longest common subsequence problem revisited
• A faster algorithm computing string edit distances
• Ant colony optimization for the cell assignment problem in PCS networks
• The Complexity of Some Problems on Subsequences and Supersequences
• Algorithms for the Longest Common Subsequence Problem
• Algorithms on Strings, Trees and Sequences
• The String-to-String Correction Problem
• On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
• A learning algorithm for the longest common subsequence problem

This page was built for publication: Finding the longest common subsequence for multiple biological sequences by ant colony optimization