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

01/18/2014
by   S. M. Ferdous, et al.
0

In this paper, we consider the problem of finding a minimum common partition of two strings. The problem has its application in genome comparison. As it is an NP-hard, discrete combinatorial optimization problem, we employ a metaheuristic technique, namely, MAX-MIN ant system to solve this problem. To achieve better efficiency we first map the problem instance into a special kind of graph. Subsequently, we employ a MAX-MIN ant system to achieve high quality solutions for the problem. Experimental results show the superiority of our algorithm in comparison with the state of art algorithm in the literature. The improvement achieved is also justified by standard statistical test.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
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
08/02/2023

An Algorithm for the Longest Common Subsequence and Substring Problem

In this note, we first introduce a new problem called the longest common...
research
05/30/2022

Byzantine Fault-Tolerant Min-Max Optimization

In this report, we consider a min-max optimization problem under adversa...
research
02/09/2021

Max-Cut via Kuramoto-type Oscillators

We consider the Max-Cut problem. Let G = (V,E) be a graph with adjacency...
research
07/07/2013

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

We present a dynamic algorithm for solving the Longest Common Subsequenc...
research
06/24/2013

A Decomposition of the Max-min Fair Curriculum-based Course Timetabling Problem

We propose a decomposition of the max-min fair curriculum-based course t...

Please sign up or login with your details

Forgot password? Click here to reset