Abstract: There are many classical algorithms for finding
routing in FPGA. But Using DNA computing we can solve the routes
efficiently and fast. The run time complexity of DNA algorithms is
much less than other classical algorithms which are used for solving
routing in FPGA. The research in DNA computing is in a primary
level. High information density of DNA molecules and massive
parallelism involved in the DNA reactions make DNA computing a
powerful tool. It has been proved by many research accomplishments
that any procedure that can be programmed in a silicon computer can
be realized as a DNA computing procedure. In this paper we have
proposed two tier approaches for the FPGA routing solution. First,
geometric FPGA detailed routing task is solved by transforming it
into a Boolean satisfiability equation with the property that any
assignment of input variables that satisfies the equation specifies a
valid routing. Satisfying assignment for particular route will result in
a valid routing and absence of a satisfying assignment implies that
the layout is un-routable. In second step, DNA search algorithm is
applied on this Boolean equation for solving routing alternatives
utilizing the properties of DNA computation. The simulated results
are satisfactory and give the indication of applicability of DNA
computing for solving the FPGA Routing problem.
Abstract: 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.
Abstract: The capturing of gel electrophoresis image represents
the output of a DNA computing algorithm. Before this image is being
captured, DNA computing involves parallel overlap assembly (POA)
and polymerase chain reaction (PCR) that is the main of this
computing algorithm. However, the design of the DNA
oligonucleotides to represent a problem is quite complicated and is
prone to errors. In order to reduce these errors during the design stage
before the actual in-vitro experiment is carried out; a simulation
software capable of simulating the POA and PCR processes is
developed. This simulation software capability is unlimited where
problem of any size and complexity can be simulated, thus saving
cost due to possible errors during the design process. Information
regarding the DNA sequence during the computing process as well as
the computing output can be extracted at the same time using the
simulation software.
Abstract: Image synthesis is an important area in image processing.
To synthesize images various systems are proposed in
the literature. In this paper, we propose a bio-inspired system to
synthesize image and to study the generating power of the system, we
define the class of languages generated by our system. We call image
as array in this paper. We use a primitive called iso-array to synthesize
image/array. The operation is double splicing on iso-arrays. The
double splicing operation is used in DNA computing and we use
this to synthesize image. A comparison of the family of languages
generated by the proposed self restricted double splicing systems on
iso-arrays with the existing family of local iso-picture languages is
made. Certain closure properties such as union, concatenation and
rotation are studied for the family of languages generated by the
proposed model.
Abstract: A Watson-Crick automaton is recently introduced as a
computational model of DNA computing framework. It works on
tapes consisting of double stranded sequences of symbols. Symbols
placed on the corresponding cells of the double-stranded sequences are
related by a complimentary relation. In this paper, we investigate a
variation of Watson-Crick automata in which both heads read the tape
in reverse directions. They are called reverse Watson-Crick finite
automata (RWKFA). We show that all of following four classes, i.e.,
simple, 1-limited, all-final, all-final and simple, are equal to
non-restricted version of RWKFA.