Parallel genetic algorithm and parallel simulated annealing algorithm for the closest string problem

Authors:
Xuan Liu;Hongmei He;Ondrej Sýkora
Affiliations:
Department of Computer Science, Loughborough University, Loughborough, Leicestershire, The United Kingdom;Department of Computer Science, Loughborough University, Loughborough, Leicestershire, The United Kingdom;Department of Computer Science, Loughborough University, Loughborough, Leicestershire, The United Kingdom
Venue:
ADMA'05 Proceedings of the First international conference on Advanced Data Mining and Applications
Year:
2005

Citing 2
Cited 8

Finding similar regions in many strings

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Distinguishing string selection problems

Information and Computation

A multipopulation parallel genetic simulated annealing-based QoS routing and wavelength assignment integration algorithm for multicast in optical networks

Applied Soft Computing
A data-based coding of candidate strings in the closest string problem

Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
More efficient algorithms for closest string and substring problems

RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
Swiftly computing center strings

WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
More Efficient Algorithms for Closest String and Substring Problems

SIAM Journal on Computing
A heuristic algorithm based on Lagrangian relaxation for the closest string problem

Computers and Operations Research
On the closest string via rank distance

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String Problem. Our implementation and experiments show usefulness of the parallel GA and SA algorithms.