scispace - formally typeset
Open AccessJournal ArticleDOI

Simulation of Parallel Logical Operations with Biomolecular Computing

Mahnaz Kadkhoda, +1 more
- 31 Dec 2008 - 
- Vol. 5, Iss: 12, pp 1758-1763
Reads0
Chats0
TLDR
A molecular-based algorithm for evaluation of Nand-based Boolean Circuits is presented using only three molecular operations and the number of passes in each level is decreased to less than half of previously addressed in the literature.
Abstract
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 Circuits. The contribution of this paper is that the proposed algorithm has been implemented using only three molecular operations and the number of passes in each level is decreased to less than half of previously addressed in the literature. Thus, the proposed algorithm is much easier to implement in the laboratory.

read more

Citations
More filters
Proceedings ArticleDOI

NARMA-L2 controller for 2-DoF underactuated planar manipulator

TL;DR: In system identification stage, the network is trained in order to approximate dynamics of the manipulator, and control law is determined to make the system output follow the reference input.
Proceedings ArticleDOI

Development of a DNA computing model for Boolean Circuit

TL;DR: A DNA based algorithm to simulate the logic functionality of any Boolean Circuit is presented and has a wide range of applicability in simulating Boolean functionality corresponding to any truth table.
Proceedings ArticleDOI

DNA Computing Models for Boolean Circuits and Logic Gates

TL;DR: This paper aims to focus on several practical and theoretical models proposed in one of the emerging subfields of DNA computing which deals with simulating Boolean Circuits and logic gates at molecular level.
Proceedings ArticleDOI

NARMA-L2 Vibration Controller for Flexible Structure with Non-collocated Sensor-Actuator

TL;DR: The investigation revealed the high capability of the proposed controller in the vibration suppression of the flexible beam structure using NARMA-L2 control strategy with non-collocated sensor-actuator placement.
References
More filters
Journal ArticleDOI

Molecular computation of solutions to combinatorial problems

TL;DR: This experiment demonstrates the feasibility of carrying out computations at the molecular level by solving an instance of the directed Hamiltonian path problem with standard protocols and enzymes.
Journal ArticleDOI

DNA solution of hard computational problems

TL;DR: DNA experiments are proposed to solve the famous "SAT" problem of computer science and have the potential to yield vast speedups over conventional electronic-based computers for such search problems.
Book

DNA Computing: New Computing Paradigms

TL;DR: This book starts with an introduction to DNA computing, exploring the power of complementarity, the basics of biochemistry, and language and computation theory, and brings the reader to the most advanced theories develop thus far in this emerging research area.
Journal ArticleDOI

Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors.

TL;DR: This study initiates the formal analysis of the generative power of recombinational behaviors in general by means of a new generative formalism called a splicing system and a significant subclass of these languages, which are shown to coincide with a class of regular languages which have been previously studied in other contexts: the strictly locally testable languages.
Book

Introduction to Coding Theory

TL;DR: The third edition has been revised and expanded as mentioned in this paper, including new chapters on algebraic geometry, new classes of codes, and the essentials of the most recent developments on binary codes, also included are exercises with complete solutions.