نتایج جستجو برای: dna computing
تعداد نتایج: 925393 فیلتر نتایج به سال:
This paper addresses two main aspects of DNA computing research: DNA computing in vitro and in vivo. We first present a model of DNA computation developed in [5]: the circular insertion/deletion system. We review the result obtained in [5] stating that this system has the computational power of a Turing machine, and present the outcome of a molecular biology laboratory experiment from [5] that ...
DNA computing is a discipline that aims at harnessing individual molecules at the nano-scopic level for computational purposes. Computation with DNA molecules possesses an inherent interest for researchers in computers and biology. Given its vast parallelism and high-density storage, DNA computing approaches are employed to solve many problems. DNA has also been explored as an excellent materia...
Deoxyribonucleic Acid or DNA computing has emerged as an interdisciplinary field that draws together chemistry, molecular biology, computer science, and mathematics. From the DNA computing point of view, it has been proven that it is possible to solve weighted graph problems by exploiting some characteristics of DNA such as length, concentration, and melting temperature. In this paper, we prese...
A lot of current research in DNA computing has been directed towards solving hard combinatorial problems. Among them Knapsack problem is one of the most common problems which have been studied intensively in the last decade attracting both theorists and practicians. Fractional Knapsack Problem is easily solvable by greedy strategy, but 0/1 Knapsack Problem is not possible to solve in this metho...
In this paper, stickers are used to construct a solution space of DNA for the satisfiability (SAT) problem. Simultaneously DNA operations are applied in the sticker-based model to develop a DNA algorithm. The result of the proposed algorithm shows that the SAT problem is resolved with biological operation in the sticker-based model for solution space of sticker. Furthermore, this work presents ...
Ever since scientists discovered that conventional silicon-based computers have physical upper limits, they have been searching for alternative media with which to solve computational problems. That search has led them, among other places, to deoxyribonucleic acid (DNA). Since Adleman’s pioneering investment, various researches have been made in DNA computing theoretically and experimentally. H...
The paper reviews two computing models by DNA self-assembly whose proof of principal have recently been experimentally confirmed. The first model incorporates DNA nano-devices and triple crossover DNA molecules to algorithmically arrange non-DNA species. This is achieved by simulating a finite-state automaton with output where golden nanoparticles are assembled to read-out the result. In the se...
This year marks the 40 anniversary of Charles Bennett’s seminal paper on reversible computing. Bennett’s contribution is remembered as one of the first to demonstrate how any deterministic computation can be simulated by a logically reversible Turing machine. Perhaps less remembered is that the same paper suggests the use of nucleic acids to realise physical reversibility. In context, Bennett’s...
Sequence design has turned out to be a crucial factor in successful DNA computing. In this paper, we present a support system for sequence design in DNA computing. Our system can fit various requirements for sequence design. The β-version of this software is available for download.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید