Star Coloring Problem: The DNA Solution

Abstract

In this paper, a DNA based computing model for solving the star coloring problem is proposed. This model shows how to use DNA strands to construct solution space of molecules for the star coloring problem and how to apply the DNA algorithm to solve the star coloring problem using biological operations. The algorithm is highly parallel and has satisfactory fidelity. The time complexity of the algorithm is O (n 2 ), where n is the number of vertices of the graph.

Top-k Closed Sequential Graph Pattern Mining

“…Recently two sequential techniques [3,10] were developed to solve the problem of graph-coloring. Graphcoloring concept [10 ] was used in processor allocation to represent the busy processor and the busy processors are mapped in the graph using different colors.…”

“…Graphcoloring concept [10 ] was used in processor allocation to represent the busy processor and the busy processors are mapped in the graph using different colors. The authors in [3] investigated the problem of Star coloring and they used DNA sequence to construct a solution space for the star coloring problem Two algorithms RP-FP and RP-GD were proposed in Copyright © 2016 MECS I.J. Information Engineering and Electronic Business, 2016, 4, 1-9 [7].…”

Locating All Common Subsequences in Two DNA Sequences

“…BLAST: (Basic Local Alignment Search Tool) [4] is an example of a larger scale. Most of these algorithms uses SmithWaterman algorithm for performing sequence alignment [6][7][8][9][10][21][22][23][24][25]. This algorithm which is also used in crimes' forensic investigation does not use full DNA to DNA sequence comparison.…”