Binary Arithmetic for DNA Computers

Barua, Rana; Misra, Janardan

doi:10.1007/3-540-36440-4_11

Cited by 15 publications

(12 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Noted representative examples are genetic algorithms [43], recursive PCR [44], algorithms using DNA sequences as templates for encryption [45], construction of DNA structures by recursive algorithms [46,47], and reconstruction of the genome by recursive assembly [48][49][50][51].…”

mentioning

confidence: 99%

The Principle of Recursive Genome Function

Pellionisz

2008

Cerebellum

View full text Add to dashboard Cite

Responding to an open request, the principle of recursive genome function (PRGF) is put forward, effectively reversing two axioms of genomics as we used to know it, prior to the Encyclopedia of DNA Elements Project (ENCODE). The PRGF is based on the reversal of the interlocking but demonstrably invalid central dogma and "Junk DNA" conjectures that slowed down the advance of sound theory of genome function, as far as information science is concerned, for half a century. PRGF illustrates the utility of the class of recursive algorithms as the intrinsic mathematics of post-ENCODE genomics. A specific recursive algorithmic approach to PRGF governing the growth of the Purkinje neuron is sketched, building the structure in a hierarchical manner, starting from primary genomic information packets and in each recursion using auxiliary genomic information packets, cancelled upon perusal. The predictive power of the principle and its experimental support are indicated. It is argued that genomics is no longer an exceptional instance of the applicability of recursion throughout the sciences.

show abstract

mentioning

confidence: 99%

The Principle of Recursive Genome Function

Pellionisz

2008

Cerebellum

View full text Add to dashboard Cite

show abstract

“…Other new suggestions to perform all basic arithmetic operations are by Atanasiu (2000) using P systems, and by Frisco (2000) using splicing operation under general H systems, and by Hug and Schuler (2001). Barua and Misra (2002) propose a recursive DNA algorithm for adding two binary numbers which requires O(log n) bio-steps using only O(n) types of DNA strands, where n is the size of the binary string representing the larger of the two numbers.…”

Section: Other Related Work and Comparison With The Adleman-lipton Modelmentioning

confidence: 99%

Fast parallel molecular solutions for DNA-based supercomputing: the subset-product problem

2005

Biosystems

View full text Add to dashboard Cite

“…Encoding binary numbers into DNA molecules represents a clever way to reduce the complexity of any logical and arithmetical operation performed on binary strings [3,2,6]. Drawn inspiration from the encoders in [3] and [2], we formulate here an improved binary encoding procedure.…”

Section: Encoding Binary Numbersmentioning

confidence: 99%

“…Drawn inspiration from the encoders in [3] and [2], we formulate here an improved binary encoding procedure. The primary idea was the following.…”

Section: Encoding Binary Numbersmentioning

confidence: 99%

Fastest parallel molecular algorithms for the elliptic curve discrete logarithm problem over GF(2n)

Iaccarino

Mazza

2009

Proceedings of the 2009 Workshop on Bio-Inspired Algorithms for Distributed Systems

View full text Add to dashboard Cite

Cryptography based on Elliptic Curves (ECC) has emerged as an effective alternative to the existing public-key cryptosystems (RSA and DSA). Its success was due both to the fact that no fast algorithms were known to break it and that exceptional security levels could be obtained by using short keys. The Elliptic Curve Discrete Logarithm (ECDL) problem is the cornerstone of much of present-day ECCs. It was classified as a computationally intractable problem and, consequently, as a reliable and unbreakable cryptosystem. In a recent work, Li et al. built a molecular computer designed to solve it over GF (2 n ). It was based on two DNA-inspired algorithms: a parallel adder and a parallel multiplier, working in O(n) and O(n 2 ) respectively, where n is the input size. In this paper, we first present two faster biological implementations, working in O(log(n)) and O(n · log(n)) respectively (worst case). Then, we propose our model as a reference parallel solution of the ECDL problem and finally we highlight the computational power of such nature-inspired paradigm.

show abstract

Binary Arithmetic for DNA Computers

Cited by 15 publications

References 6 publications

The Principle of Recursive Genome Function

The Principle of Recursive Genome Function

Fast parallel molecular solutions for DNA-based supercomputing: the subset-product problem

Fastest parallel molecular algorithms for the elliptic curve discrete logarithm problem over GF(2n)

Contact Info

Product

Resources

About