A DNA computer model for solving vertex coloring problem (original) (raw)
Related papers
DNA Solution of a Graph Coloring Problem
Journal of Chemical Information and Modeling, 2002
The graph-theoretic parameter that has probably received the most attention over the years is the chromatic number. As is well-known, the coloring problem is an NP-Complete problem. In this paper, it has been solved by means of molecular biology techniques. The algorithm is highly parallel and has satisfactory fidelity. This work shows further evidence for the ability of DNA computing to solve NP-Complete problems.
International Journal in Foundations of Computer Science & Technology (IJFCST), 2013
Although it has been evidenced that DNA computing is able to solve the graph coloring problem in a polynomial time complexity, but the exponential solution space is still a restrictive factor in applying this technique for solving really large problems. In this paper a modified DNA computing approach based on Adleman-Lipton model is proposed which tackles the mentioned restriction by coloring the vertices one by one. In each step, it expands the DNA strands encoding promising solutions and discards those which encode infeasible ones. A sample graph is colored by simulating the proposed approach and shows a notable reduction in the number of DNA strands used.
2003
Deoxyribonucleic Acid or DNA computing has emerged as an interdisciplinary field that draws together chemistry, molecular biology, computer science and mathematics. Thus, in this paper, the possibility of DNA-based computing to solve an absolute 1-center problem by molecular manipulations is presented. This is truly the first attempt to solve such a problem by DNA-based computing approach. Since, part of the procedures involve with shortest path computation, research works on DNA computing for shortest path Traveling Salesman Problem, in short, TSP are reviewed. These approaches are studied and only the appropriate one is adapted in designing the computation procedures. This DNA-based computation is designed in such a way that every path is encoded by oligonucleotides and the path's length is directly proportional to the length of oligonucleotides. Using these properties, gel electrophoresis is performed in order to separate the respective DNA molecules according to their length. One expectation arise from this paper is that it is possible to verify the instance absolute 1-center problem using DNA computing by laboratory experiments.
DNA Computing and Its Applications
2008
The aim of the paper is to make a review of DNA computing achievements on current stage, especially on new approaches or methods contributing to solve either theoretical or application problems. Starting with the NP-problem that Adleman solved by means of wet DNA experiment in 1994, DNA becomes one of the most appropriate alternatives to overcome the silicon computer limitations. Today, many researchers concentrate on this research subject either to improve available methods used in DNA computing itself or to suggest a new way to solve engineering or application problems with a DNA computing approach. This paper gives an overview of research achievements in DNA computing and touches on the achievements of improving methods employed in DNA computing as well as in solving application problems. At the end of discussion we address several challenges that DNA computing are facing in the society.
DNA COMPUTING AND ITS APPLICATIONS: SURVEY
2008
The aim of the paper is to make a review of DNA computing achievements on current stage, especially on new approaches or methods contributing to solve either theoretical or application problems. Starting with the NP-problem that Adleman solved by means of wet DNA experiment in 1994, DNA becomes one of the most appropri- ate alternatives to overcome the silicon computer limitations. Today, many researchers concentrate on this research subject either to improve available methods used in DNA computing itself or to suggest a new way to solve engineering or application problems with a DNA computing approach. This paper gives an overview of research achievements in DNA computing and touches on the achievements of improving methods employed in DNA computing as well as in solving application problems. At the end of discussion we address several challenges that DNA computing are facing in the society.
Computation by Self-assembly of DNA Graphs
Genetic Programming and Evolvable Machines, 2003
Using three dimensional graph structure and DNA self-assembly we show that theoretically 3-SAT and 3-colorability can be solved in a constant number of laboratory steps. In this assembly, junction molecules and duplex DNA molecules are the basic building blocks. The graphs involved are not necessarily regular, so experimental results of self-assembling non regular graphs using junction molecules as vertices and duplex DNA molecules as edge connections are presented.
DNA computing is essential computation using biological molecules rather than traditional silicon chips. In recent years, DNA computing has been a research tool for solving complex problems. Despite this, it is still not easy to understand. The aim of this paper is present DNA computing in simple terms that a beginner can understand. Introduction Development in traditional electronic computers is restricted by hardware problems. DNA computing will solve that problem and serve as an alternative technology. DNA computing is also known as molecular computing. It is computing using the processing power of molecular information instead the conventional digital components. It is one of the non-silicon based computing approaches. DNA has been shown to have massive processing capabilities that might allow a DNA-based computer to solve complex problems in a reasonable amount of time. DNA computing was proposed by Leonard Adleman, who demonstrated in 1994 that DNA could be applied in computations [1]. He used DNA to solve a small instance of the traveling salesman problem, in which the objective is to find the most efficient route through seven cities connected by 14 one-way flights. Adleman solved this problem by creating strands of DNA to represent each flight and then combined them to generate every possible route [2, 3]. The graph in Adleman's experiment is shown in Figure1. Adleman's work have set imaginations blazing throughout the world and across disciplines. It introduced a new revolutionary era in the field of computing. DNA computing is now an interdisciplinary research field where chemistry, molecular biology, computer science, mathematics, and technology come together.
DNA Computing: A Complete Overview
International Journal of Science and Research (IJSR)
DNA computing is a nascent technology that seeks to capitalize on the enormous informational capacity of DNA, biological molecules that can store huge amounts of information and are able to perform operations similar to computers through the deployment of enzymes, biological catalysts that act like software to execute desired operations i.e. Computers made of genes' building blocks. Because of their speed, miniaturization and Data Storage potential DNA computers are being considered as a replacement for silicon-based computers. Current DNA computer research has already proven that DNA computers are capable of solving complex mathematical equations and storing enormous amounts of data.
DNA Computer; Present and Future
DNA computers use strands of DNA to perform computing operations. The computer consists of two types of strandsthe instruction strands and the input data strands. The instruction strands splice together the input data strands to generate the desired output data strand. DNA computing holds out the promise of important and significant connections between computers and living systems, as well as promising massively parallel computations. Before these promises are fulfilled, however, important challenges related to errors and practicality has to be addressed. On the other hand, new directions toward a synthesis of molecular evolution and DNA computing might circumvent the problems that have hindered development, so far. This paper represent present and future DNA computer.
IOSR Journal of Computer Engineering, 2016
In this article the using of novel generation of computers will be pointed that use some chips from the DNA type replace to silicon ones. Their structure is similar to biologic DNA.So, it should be possible to generate these DNA strings in lab and uploaded needed information on them and after that the results of DNA string converted to an apprehensible model for human. This process needs working with devices related to biology. Upon to performed experiments, the DNA strings have the considerable speed in calculation than silicon chips and also the return result of these chips always are true.In this article a simple and applied sample will be explained. Also the disadvantages and flaws of these kind of chips will be clarified.