A Dynamic Algorithm for the Longest Common Subsequence Problem using Ant Colony Optimization Technique

07/07/2013
by   Arindam Chaudhuri, et al.
0

We present a dynamic algorithm for solving the Longest Common Subsequence Problem using Ant Colony Optimization Technique. The Ant Colony Optimization Technique has been applied to solve many problems in Optimization Theory, Machine Learning and Telecommunication Networks etc. In particular, application of this theory in NP-Hard Problems has a remarkable significance. Given two strings, the traditional technique for finding Longest Common Subsequence is based on Dynamic Programming which consists of creating a recurrence relation and filling a table of size . The proposed algorithm draws analogy with behavior of ant colonies function and this new computational paradigm is known as Ant System. It is a viable new approach to Stochastic Combinatorial Optimization. The main characteristics of this model are positive feedback, distributed computation, and the use of constructive greedy heuristic. Positive feedback accounts for rapid discovery of good solutions, distributed computation avoids premature convergence and greedy heuristic helps find acceptable solutions in minimum number of stages. We apply the proposed methodology to Longest Common Subsequence Problem and give the simulation results. The effectiveness of this approach is demonstrated by efficient Computational Complexity. To the best of our knowledge, this is the first Ant Colony Optimization Algorithm for Longest Common Subsequence Problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/08/2021

On Solving the Minimum Common String Partition Problem by Decision Diagrams

In the Minimum Common String Partition Problem (MCSP), we are given two ...
research
01/17/2018

Solving Minimum k-supplier in Adleman-Lipton model

In this paper, we consider an algorithm for solving the minimum k suppli...
research
09/19/2013

An ant colony optimization algorithm for job shop scheduling problem

The nature has inspired several metaheuristics, outstanding among these ...
research
06/06/2023

Learning-Based Heuristic for Combinatorial Optimization of the Minimum Dominating Set Problem using Graph Convolutional Networks

A dominating set of a graph 𝒢=(𝒱, ℰ) is a subset of vertices S⊆𝒱 such th...
research
02/01/2017

A Hybrid Evolutionary Algorithm Based on Solution Merging for the Longest Arc-Preserving Common Subsequence Problem

The longest arc-preserving common subsequence problem is an NP-hard comb...
research
01/18/2014

Solving the Minimum Common String Partition Problem with the Help of Ants

In this paper, we consider the problem of finding a minimum common parti...
research
10/25/2018

Optimizing Capacitated Vehicle Scheduling with Time Windows: A Case Study of RMC Delivery

Ready Mixed Concrete Delivery Problem (RMCDP) is a multi-objective multi...

Please sign up or login with your details

Forgot password? Click here to reset