DNA computing

View this topic in
DNA computing is a form of computing which uses DNA, biochemistry and molecular biology, instead of the traditional silicon-based computer technologies. (Wikipedia.org)






Conferences related to DNA computing

Back to Top

2021 IEEE International Conference on Mechatronics (ICM)

CM focuses on recent developments and future prospects related to the synergetic integration of mechanics, electronics, and information processing.


2020 42nd Annual International Conference of the IEEE Engineering in Medicine & Biology Society (EMBC)

The conference program will consist of plenary lectures, symposia, workshops and invitedsessions of the latest significant findings and developments in all the major fields of biomedical engineering.Submitted papers will be peer reviewed. Accepted high quality papers will be presented in oral and postersessions, will appear in the Conference Proceedings and will be indexed in PubMed/MEDLINE


2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC)

The 2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC 2020) will be held in Metro Toronto Convention Centre (MTCC), Toronto, Ontario, Canada. SMC 2020 is the flagship conference of the IEEE Systems, Man, and Cybernetics Society. It provides an international forum for researchers and practitioners to report most recent innovations and developments, summarize state-of-the-art, and exchange ideas and advances in all aspects of systems science and engineering, human machine systems, and cybernetics. Advances in these fields have increasing importance in the creation of intelligent environments involving technologies interacting with humans to provide an enriching experience and thereby improve quality of life. Papers related to the conference theme are solicited, including theories, methodologies, and emerging applications. Contributions to theory and practice, including but not limited to the following technical areas, are invited.


ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

The ICASSP meeting is the world's largest and most comprehensive technical conference focused on signal processing and its applications. The conference will feature world-class speakers, tutorials, exhibits, and over 50 lecture and poster sessions.


SoutheastCon 2020

SoutheastCon is the annual Region 3 conference that brings together engineering professionals, students, and volunteers for a weekend of technical presentations, meetings, student competitions, and volunteer education.

  • SoutheastCon 2021

    IEEE SoutheastCon is the annual IEEE Region 3 Student, Professional, and awards conference.

  • SoutheastCon 2019

    The annual IEEE SoutheastCon conferences promote all aspects of theories and applications of engineering disciplines. Sponsored by the IEEE Region-3 and IEEE Huntsville Section, this event will attract researchers, professionals, and students from the Southeastern region of the U.S. SoutheastCon 2019 will feature tutorial sessions, workshops, Technical Programs, and student Hardware, Software, Ethics, Paper, Web competitions.

  • SoutheastCon 2018

    SoutheastCon is a annual conference held in Region 3 and covers a Professional Track, Student Track and Regional Track.

  • SoutheastCon 2017

    Broad scope professional paper conference, region 3 annual meeting, region 3 annual student conference

  • SoutheastCon 2016

    Annual Region 3 Trifecta of Student competitions, Technical papers and volunteer training and administration.

  • SoutheastCon 2015

    Horizontal Technical Conference with all topics; students compete in multiple competions; Region 3 training meetings.

  • SOUTHEASTCON 2014

    Horizontal Technical Conference with all topics; students compete in multiple competions; Region 3 training meetings.

  • IEEE SOUTHEASTCON 2013

    Region 3 Meeting, Technical papers, student competitions.

  • SOUTHEASTCON 2012

    The annual IEEE SoutheastCon conferences promote all aspects of the theories and applications of the engineering disciplines. Sponsored by the IEEE Region 03, this event attracts researchers, professionals, and students from the Southeast region of the U.S and beyond. SoutheastCon 2012 will be held in Orlando, Florida.

  • SOUTHEASTCON 2011

    IEEE SoutheastCon2011 is the annual IEEE Region 3 technical, professional, and student conference, invites conference refereed and non-refereed technical paper presentations and tutorials that advance the work and careers of conference attendees in the areas of interest for the conference.

  • SOUTHEASTCON 2010

    SoutheastCon 2010 is the Region 3 event which includes a student conference, a technical conference, and the Region 3 business meeting.

  • SOUTHEASTCON 2009

    It is the annual IEEE Region 3 Technical, Professional, and Student Conference. As the premier conference for the IEEE Region 3, it brings together electrical, computer and other engineering and science professionals, faculty and students to share the latest information through technical sessions, tutorials and exhibits. The conference schedule includes: a technical program with seminars, tutorials, and workshops; exhibits; a student program with student competitions; and IEEE regional meetings.

  • SOUTHEASTCON 2008

    SoutheastCon is the Southeastern USA Region of the IEEE's premier conference. It contains three main sections: a technical program, student competitions and regional meetings. SouthEastCon features technical papers, tutorials and exhibits.

  • SOUTHEASTCON 2007

  • SOUTHEASTCON 2006

  • SOUTHEASTCON 2005

  • SOUTHEASTCON 2004

  • SOUTHEASTCON 2003

  • SOUTHEASTCON 2002

  • SOUTHEASTCON 2001

  • SOUTHEASTCON 2000

  • SOUTHEASTCON '99

  • SOUTHEASTCON '98

  • SOUTHEASTCON '97

  • SOUTHEASTCON '96


More Conferences

Periodicals related to DNA computing

Back to Top

Biomedical Engineering, IEEE Transactions on

Broad coverage of concepts and methods of the physical and engineering sciences applied in biology and medicine, ranging from formalized mathematical theory through experimental science and technological development to practical clinical applications.


Circuits and Systems I: Regular Papers, IEEE Transactions on

Part I will now contain regular papers focusing on all matters related to fundamental theory, applications, analog and digital signal processing. Part II will report on the latest significant results across all of these topic areas.


Computational Biology and Bioinformatics, IEEE/ACM Transactions on

Specific topics of interest include, but are not limited to, sequence analysis, comparison and alignment methods; motif, gene and signal recognition; molecular evolution; phylogenetics and phylogenomics; determination or prediction of the structure of RNA and Protein in two and three dimensions; DNA twisting and folding; gene expression and gene regulatory networks; deduction of metabolic pathways; micro-array design and analysis; proteomics; ...


Computer

Computer, the flagship publication of the IEEE Computer Society, publishes peer-reviewed technical content that covers all aspects of computer science, computer engineering, technology, and applications. Computer is a resource that practitioners, researchers, and managers can rely on to provide timely information about current research developments, trends, best practices, and changes in the profession.


Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

Methods, algorithms, and human-machine interfaces for physical and logical design, including: planning, synthesis, partitioning, modeling, simulation, layout, verification, testing, and documentation of integrated-circuit and systems designs of all complexities. Practical applications of aids resulting in producible analog, digital, optical, or microwave integrated circuits are emphasized.


More Periodicals


Xplore Articles related to DNA computing

Back to Top

An Improved In Silico Algorithm for Output Visualization of DNA Computing Based on Real-Time PCR

2008 Second Asia International Conference on Modelling & Simulation (AMS), 2008

In the previous paper, a readout approach for the Hamiltonian Path Problem (HPP) in DNA computing based on the real-time polymerase chain reaction (PCR) was proposed. Based on this approach, realtime amplification was performed with the TaqMan probes and the TaqMan detection mechanism was exploited for the design and development of the proposed readout approach. The readout approach consists of ...


A DNA Encoding Method to Determine and Sequence All Cliques in a Weighted Graph

2009 Fourth International Conference on Innovative Computing, Information and Control (ICICIC), 2009

In many aspects of advanced applied information technology, science, and bioinformatics, having theoretical concepts based on graph theory provides an important way to create or develop new hybrids, combined information, and intelligent techniques or methods. Finding the maximum weighted clique problem can be a significant issue and concept in graph theory. Meanwhile, encoding biological codes, represented as biological sequence information, ...


Stochastic model of DNA microarrays

Proceedings of the IEEE-EMBS Special Topic Conference on Molecular, Cellular and Tissue Engineering, 2002

Classical stochastic signal modeling is applied to DNA microarray images. The data reflects a small exponential additive noise process and a larger Gaussian fluctuation that scales with spot intensity. The later is likely do to the array fabrication (i.e. printing) process. Correlations are observed amongst pixels in the spot and between test and control images.


DNA cryptography…life blood for new ERA computers

2017 International Conference on Energy, Communication, Data Analytics and Soft Computing (ICECDS), 2017

Internet is growing every day. But it became a great challenge to provide security to the data transferring through Internet. Though there are many security strategies developed, intruders are working with different methods to hack and modify the data. Now-a-days, DNA computing is one of the emerging research areas of Computer Science. The computational process speed is very high by ...


On construction of codes for DNA computers

IEEE International Symposium on Information Theory, 2003. Proceedings., 2003

We describe similarities between constraints of codes for DNA computers and constraints which appear in digital magnetic recording. We apply coding techniques developed for digital recording systems to problems on DNA sequences for DNA computers.


More Xplore Articles

Educational Resources on DNA computing

Back to Top

IEEE.tv Videos

PGX Clinical Decision Support Implementation - Peter Hulick - IEEE EMBS at NIH, 2019
Rebooting Computing: Parallelism in Computing
Q&A with Elie Track: IEEE Rebooting Computing Podcast, Episode 2
How Bio-Design Automation Can Help Reboot Computing: Lessons, Challenges, and Future Directions - IEEE Rebooting Computing 2017
Special Evening Panel Discussion: AI, Cognitive Information Processing, and Rebooting Computing - IEEE Rebooting Computing 2017
Verification in the Nanoscale Era of Computing - IEEE Rebooting Computing 2017
Quantum Accelerators for High-Performance Computing Systems - IEEE Rebooting Computing 2017
Rebooting Computing: Changing Computing
ROI from NASA to Health & Health Care on Earth - Aenor Sawyer - IEEE EMBS at NIH, 2019
Q&A with Michael Garner: IEEE Rebooting Computing Podcast, Episode 11
Towards Truly Adiabatic Operation: IEEE Rebooting Computing 2017
Q&A with Dejan Milojicic: IEEE Rebooting Computing Podcast, Episode 26
Q&A with Scott Koziel: IEEE Rebooting Computing Podcast, Episode 23
DOE Vision and Programmatic Activities in Advanced Computing Technologies: IEEE Rebooting Computing 2017
An Energy-efficient Reconfigurable Nanophotonic Computing Architecture Design: Optical Lookup Table - IEEE Rebooting Computing 2017
Energy Efficient Single Flux Quantum Based Neuromorphic Computing - IEEE Rebooting Computing 2017
A Unified Hardware/Software Co-Design Framework for Neuromorphic Computing Devices and Applications - IEEE Rebooting Computing 2017
Removing The Golden Handcuffs: Computing At The End of Moore's Scaling - IEEE Rebooting Computing Industry Summit 2017
DARPA's Vision for the Future of Computing: IEEE Rebooting Computing 2017
From the Quantum Moore's Law toward Silicon Based Universal Quantum Computing - IEEE Rebooting Computing 2017

IEEE-USA E-Books

  • An Improved In Silico Algorithm for Output Visualization of DNA Computing Based on Real-Time PCR

    In the previous paper, a readout approach for the Hamiltonian Path Problem (HPP) in DNA computing based on the real-time polymerase chain reaction (PCR) was proposed. Based on this approach, realtime amplification was performed with the TaqMan probes and the TaqMan detection mechanism was exploited for the design and development of the proposed readout approach. The readout approach consists of two steps: real-time amplification in vitro using TaqMan- based real-time PCR, followed by information processing in silico to assess the results of real-time amplification, which in turn, enables extraction of the Hamiltonian path. The in silico information processing consists an algorithm to extract the Hamiltonian path based on result of in vitro realtime PCR experiment. However, this algorithm indirectly shows the Hamitonian path by only showing the location of each node for the HPP. Thus, in this paper, we modified the previous in silico algorithm such that the Hamiltonian path can be viewed directly after the in silico information processing of the TaqMan reactions based on real-time PCR is implemented. The modified algorithm can be easily implemented in the computerized application.

  • A DNA Encoding Method to Determine and Sequence All Cliques in a Weighted Graph

    In many aspects of advanced applied information technology, science, and bioinformatics, having theoretical concepts based on graph theory provides an important way to create or develop new hybrids, combined information, and intelligent techniques or methods. Finding the maximum weighted clique problem can be a significant issue and concept in graph theory. Meanwhile, encoding biological codes, represented as biological sequence information, is an important process in executing biological computations. In this paper, we focus on a way of encoding biological sequences to create a new encoding method particularly designed to solve clique problems in a weighted graph.

  • Stochastic model of DNA microarrays

    Classical stochastic signal modeling is applied to DNA microarray images. The data reflects a small exponential additive noise process and a larger Gaussian fluctuation that scales with spot intensity. The later is likely do to the array fabrication (i.e. printing) process. Correlations are observed amongst pixels in the spot and between test and control images.

  • DNA cryptography…life blood for new ERA computers

    Internet is growing every day. But it became a great challenge to provide security to the data transferring through Internet. Though there are many security strategies developed, intruders are working with different methods to hack and modify the data. Now-a-days, DNA computing is one of the emerging research areas of Computer Science. The computational process speed is very high by using DNA computers when compared to traditional systems. When Adleman introduced the concept of calculating complex problems using DNA, most of the researchers concentrate on DNA computing to meet the challenges of solving the complex problems. Some of the researchers realised that the best information carrier is the DNA and also many of them are interested to develop different cryptographic algorithms to provide security using DNA which is going to be used in DNA Computer Systems. By using the bio Molecular technology, security keys generated by DES are extracted in short span. Keeping in view the importance of DNA, because of its inherent quality of parallelization and hugeness that stores enormous information, in this paper I would highlight the concepts of DNA computing and throw light on the various algorithms developed in the field of DNA cryptography.

  • On construction of codes for DNA computers

    We describe similarities between constraints of codes for DNA computers and constraints which appear in digital magnetic recording. We apply coding techniques developed for digital recording systems to problems on DNA sequences for DNA computers.

  • Closed Circle DNA Algorithm of Hamilton Circuit Problem

    Closed circle DNA used in the paper has equal length. For different closed circle DNA, the same position is corresponding to different recognition sequence, and the same recognition sequence is corresponding to different foreign DNA segment. Closed circle DNA algorithm of Hamilton circuit problem is put forward. In the algorithm, three groups of DNA encoding are encoded for all arcs, and deck groups are designed for all vertices. All possible solutions are synthesized. Then, the feasible solutions are filtered out by group detect experiment, and the optimization solutions are obtained by group insert experiment and electro-phoresis experiment. Finally, all optimization solutions are put-out by detect experiment. Complexity of algorithm is concluded and validity of DNA algorithm is explained by an example. Two dominances of the closed circle DNA algorithm are analyzed.

  • Multiplexer and demultiplexer design with DNA-Computation

    DNA-Computation is one of the latest inter disciplinary issues and an efficient technique to solve non-polynomial problem by polynomial time. In this paper I have showed a 5-steps design procedure of Multiplexer and Demultiplexer with DNA-Computation which is performed in a constant time for 1×n Demultiplexer and n×1 Multiplexer. Actually it is an example of top-down design procedure with DNA.

  • DNA Computing for Traveling Salesman Problem

    In this paper, Genetic algorithms is applied to traveling salesman problem whose solution requires encoding of real values in DNA strands. Encode weights in DNA computing is an important but challenging problem because many practical applications in the real world involve weights. In order to efficiently encode weights in DNA strands, we firstly proposed two definitions, the order number of weight and the relative length graph. And then, by means of the two definitions, we have devised a new method of encoding weights in DNA strands for a weighted graph. DNA algorithm solving the traveling salesman problem is given. The effectiveness of the proposed method is verified by simulation. The method was applied to solve the traveling salesman problem, and it can be expanded to solve other numerical optimization problems.

  • Fredkin gate circuits via recombination enzymes

    Using DNA, Fredkin gates are constructed whose outputs are used as inputs for other Fredkin gates. Each gate is designed to operate at a particular time step, although many different gates can operate simultaneously. Thus, arbitrary circuits of Fredkin gates can be constructed, including computers. An example application is given: a depth-two decision tree circuit that directs control and data from one gate to the next.

  • Non-deterministic Algorithm for Routing Optimization: A Case Study

    A routing optimization problem is solved by a non- deterministic algorithm in this paper. The DNA computing is applied for a case of cable trench problem. The cable trench problem is a combination of the shortest path problem and the minimum spanning tree problem, which makes it difficult to be solved by a conventional computing method. DNA computing is applied to overcome the limitation of a silicon-based computer. The numerical values are represented by the fixed-length DNA strands, and the weights are varied by the melting temperatures. Biochemical techniques with DNA thermodynamic properties are used for effective local search of the optimal solution.



Standards related to DNA computing

Back to Top

No standards are currently tagged "DNA computing"


Jobs related to DNA computing

Back to Top