Abstract As global demand for digital storage capacity grows, technologies based on synthetic DNA have emerged as a dense and durable alternative to traditional media. Existing approaches leverage robust error correcting codes precise molecular mechanisms reliably retrieve specific files from large databases. Typically, are retrieved using pre-specified key, analogous filename. However, these l...

We introduce a DNA encoding method to represent numerical values and a biased molecular algorithm based on the thermodynamic properties of DNA. DNA strands are designed to encode real values by variation of their melting temperatures. The thermodynamic properties of DNA are used for effective local search of optimal solutions using biochemical techniques, such as denaturation temperature gradie...

DNA computing often makes use of annealing or hybridization, whether for vastly generating the initial candidate answers or amplification by using polymerase chain reaction. The main idea behind molecular search or DNA computing approaches for solving weighted graph problems is by controlling the degree of hybridization in order to generate more double stranded DNA, which represent the answer o...

DNA computing is an interdisciplinary field accessing the possibility for the use of biomolecules, such as DNA, RNA and proteins, as a computational or control tool. Traditionally, DNA computers were thought to compete with electronic computers to solve, for example, NP-complete problems. However recently, there has been a focus shift to biomedical applications. One form of DNA computing is per...

Biomolecular computing is the computational method that uses the potential of DNA as a parallel computing device. DNA computing can be used to solve NP-complete problems. An appropriate application of DNA computation is large-scale evaluation of parallel computation models such as Boolean Circuits. In this study, we present a molecular-based algorithm for evaluation of Nand-based Boolean Circui...

DNA-based computing is a novel technique to tackle computationally difficult problems, in which computing time grows exponentially corresponding to problematic size. A strategic assignment problem is a typical nondeterministic polynomial problem, which is often associated with strategy applications. In this Letter, a new approach dealing with strategic assignment problems is proposed based on m...

grid computing is a term referring to the combination of computer resources from multiple administrative domains to reach a common computational platform. mobile computing is a generic word that introduces using of movable, handheld devices with wireless communication, for processing data. mobile computing focused on providing access to data, information, services and communications anywhere an...