A DNA-Based genetic algorithm implementation for graph coloring problem

Authors:
Xiaoming Liu;Jianwei Yin;Jung-Sing Jwo;Zhilin Feng;Jinxiang Dong
Affiliations:
Department of Computer Science and Technology, Zhejiang University, HangZhou, China;Department of Computer Science and Technology, Zhejiang University, HangZhou, China;Department of Computer Science and Technology, Zhejiang University, HangZhou, China;Department of Computer Science and Technology, Zhejiang University, HangZhou, China;Department of Computer Science and Technology, Zhejiang University, HangZhou, China
Venue:
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part II
Year:
2005

Citing 7
Cited 0

Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
Molecular computation of solutions to combinatorial problems

Science
The power of surface-based DNA computation (extended abstract)

RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
A Space-Efficient Randomized DNA Algorithm for k-SAT

DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
A DNA-Based Random Walk Method for Solving k-SAT

DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
A PNA-mediated Whiplash PCR-based Program for In Vitro Protein Evolution

DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
DNA models and algorithms for NP-complete problems

CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an implementation of Croitoru's genetic algorithm for graph coloring problem, and some necessary modification and simplifying are made by using DNA operations. In this algorithm, each vertex and edge is encoded with a series of encodings incorporating position information, and the initial diverse candidate population is generated using POA. One crossover operator, two mutation operators, evaluation and selection operators are all implemented using basic operations on DNA. It is shown that the algorithm can be implemented with space complexity much decreased and time complexity O(mn2) to get a new generation, where n is the number of vertices and m is the number of edges. Moreover, borrowing ideas from the above implementation, an algorithm for Maximal Clique problem is also presented.