Fast parallel molecular algorithms for DNA-based computation: factoring integers

No abstract is available for this paper.

• Publication year

  2004

• Venue

  Proceedings. Fourth IEEE Symposium on Bioinformatics and Bioengineering

• Publication date

  2004-05-19

• Fields of study

  Biology, Computer Science

• Identifiers
  DOI 10.1109/BIBE.2004.1317334
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing

  2004cited by this paper
• Molecular solutions for the subset-sum problem on DNA-based supercomputing.

  2004cited by this paper
• Solving the set cover problem and the problem of exact cover by 3-sets in the Adleman-Lipton model.

  2003cited by this paper
• Is Cook's Theorem Correct for DNA-Based Computing?

  2003cited by this paper
• Solving the Set-Splitting Problem in Sticker-Based Model and the Adleman-Lipton Model

  2003cited by this paper
• Solution of a 20-Variable 3-SAT Problem on a DNA Computer

  2002cited by this paper
• Binary Arithmetic for DNA Computers

  2002cited by this paper
• Solving Knapsack Problems in a Sticker Based Model

  2001cited by this paper
• DNA-based Parallel Computation of Simple Arithmetic

  2001cited by this paper
• Parallel arithmetic with splicing

  2000cited by this paper
• Solution of a Satisfiability Problem on a Gel-Based DNA Computer

  2000cited by this paper
• Challenges and Applications for Self-Assembled DNA Nanostructures

  2000cited by this paper
• Logical computation using algorithmic self-assembly of DNA triple-crossover molecules

  2000cited by this paper
• Chess games: a model for RNA based computation.

  1999cited by this paper
• On Applying Molecular Computation to the Data Encryption Standard

  1999cited by this paper
• Solving traveling salesman problems using molecular programming

  1999cited by this paper
• DIMACS Series in Discrete Mathematics and Theoretical Computer Science Experimental Progress in Computation by Self-Assembly of DNA

  1999cited by this paper
• DNA Computing

  1998cited by this paper
• A Sticker-Based Model for DNA Computation

  1998cited by this paper
• Solid phase DNA solution to the Hamiltonian path problem

  1997cited by this paper
• Arithmetic and logic operations with DNA

  1997cited by this paper
• DNA solution of the maximal clique problem.

  1997cited by this paper
• Simulating Boolean Circuits on a DNA Computer

  1997cited by this paper
• Volume bounded molecular computation

  1997cited by this paper
• DNA models and algorithms for NP-complete problems

  1996cited by this paper
• A restricted genetic alphabet for DNA computing

  1996cited by this paper
• Maya Blue Paint: An Ancient Nanostructured Material

  1996cited by this paper
• On the Computational Power of DNA

  1996cited by this paper
• Breaking DES using a molecular computer

  1995cited by this paper
• DNA solution of hard computational problems.

  1995cited by this paper
• Molecular computation of solutions to combinatorial problems.

  1994cited by this paper
• Recombinant DNA, 2nd edn.

  1992cited by this paper
• A method for obtaining digital signatures and public-key cryptosystems

  1978cited by this paper
• Reducibility Among Combinatorial Problems

  1972cited by this paper
• The complexity of theorem-proving procedures

  1971cited by this paper
• 遺伝子の分子生物学 = Molecular biology of the gene

  1970cited by this paper

• Advancing Archival Data Storage: The Promises and Challenges of DNA Storage System

  2025cites this paper
• Cryptanalysis of RSA Cryptosystem: Prime Factorization using Genetic Algorithm

  2024cites this paper
• Optimal Codeword Construction for DNA-based Finite Automata

  2022cites this paper
• An Enhancement in Data Security Using Trellis Algorithm with DNA Sequences in Symmetric DNA Cryptography

  2022cites this paper
• Circuit and microcontroller validation of the extreme multistable dynamics of a memristive Jerk system: application to image encryption

  2022cites this paper
• Comparison of Monkeypox and Wart DNA Sequences with Deep Learning Model

  2022cites this paper
• Complex dynamical behaviors of a novel exponential hyper–chaotic system and its application in fast synchronization and color image encryption

  2021cites this paper
• The Maximum (k,m)-Subsets Problem is in the Class NEXP

  2021cites this paper
• Cryptanalysis of RSA: Integer Prime Factorization Using Genetic Algorithms

  2020cites this paper
• A New Molecular Encryption Model Based on Microfluidic Techniques

  2019cites this paper
• New Generic Design to Expedite Asymmetric Cryptosystems Using Three-levels of Parallelism

  2018cites this paper
• An Image Encryption Method Based on the Feistel Network and Dynamic DNA Encoding

  2018cites this paper
• Chaotic Image Encryption Algorithm Based on Bit Permutation and Dynamic DNA Encoding

  2017cites this paper
• Image Encryption Algorithm Based on Hyperchaotic Maps and Nucleotide Sequences Database

  2017cites this paper
• Integer Programming Problem Based on Plasmid DNA Computing Model

  2017cites this paper
• Solving the 0-1 knapsack problem based on a parallel intelligent molecular computing model system

  2017cites this paper
• Parallel DNA Arithmetic Operation With One Error Detection Based on 3-Moduli Set

  2016cites this paper
• A new DNA cryptosystem based on AG codes evaluated in gaussian channels

  2016cites this paper
• A LITERATURE STUDY ON PARALLEL KEY CRYPTOGRAPHIC ALGORITHM

  2016cites this paper
• Quantum Computational Number Theory

  2015influential citation
• Molecular Sticker Model Stimulation on Silicon for a Maximum Clique Problem

  2015cites this paper
• State of the art parallel approaches for RSA public key based cryptosystem

  2015cites this paper
• A Parallel Biological Optimization Algorithm to Solve the Unbalanced Assignment Problem Based on DNA Molecular Computing

  2015cites this paper
• Solving the Maximum Weighted Clique Problem Based on Parallel Biological Computing Model

  2015cites this paper
• Intelligent Optimization of Wireless Sensor Networks through Bio-Inspired Computing: Survey and Future Directions

  2013cites this paper
• Information hiding based on DNA steganography

  2013cites this paper
• Molecular Solutions for the Set-Partition Problem on Dna-Based Computing

  2013cites this paper
• Improved DNA-sticker arithmetic: tube-encoded-carry, Logarithmic Number System and Monte-Carlo methods

  2013influential citation
• Fast Parallel DNA-Based Algorithms for Molecular Computation: Quadratic Congruence and Factoring Integers

  2012cites this paper
• DNA-Based Active Logic Design and Its Implications

  2012cites this paper
• Molecular solutions of the RSA public-key cryptosystem on a DNA-based computer

  2012cites this paper
• Fast parallel DNA-based algorithms for molecular computation: discrete logarithm

  2011cites this paper
• Breaking DES in tile assembly models

  2011cites this paper
• Application of bio-inspired algorithm to the problem of integer factorisation

  2010cites this paper
• Approximate reasoning on a DNA-chip

  2010cites this paper
• Solving Capacitated Vehicle Routing Problem Using DNA-based Computation

  2009cites this paper
• Transforming bases to bytes: Molecular computing with DNA

  2009cites this paper
• Fastest parallel molecular algorithms for the elliptic curve discrete logarithm problem over GF(2n)

  2009influential citation
• Arithmetic computation using self-assembly of DNA tiles: subtraction and division

  2009cites this paper
• Quantum Algorithms of Bio-molecular Solutions for the Clique Problem on a Quantum Computer

  2009cites this paper
• Quantum Algorithms for Biomolecular Solutions of the Satisfiability Problem on a Quantum Machine

  2008cites this paper
• A DNA-Based Solution to the Subgraph Isomorphism Problem

  2008cites this paper
• One-Time-Pads encryption in the tile assembly model

  2008cites this paper
• Quantum algorithms for bio-molecular solutions to the satisfiability problem on a quantum computer

  2008cites this paper
• A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers

  2008cites this paper
• Fast Parallel DNA-Based Algorithms for Molecular Computation: The Set-Partition Problem

  2007cites this paper
• Biomolecular computing: Is it ready to take off?

  2007cites this paper
• Design of an irreversible DNA memory element

  2007cites this paper
• Constructing Bio-molecular Parallel Adder with Basic Logic Operations in the Adleman-Liption Model

  2007cites this paper
• Constructing Bio-molecular Databases on a DNA-based Computer

  2007cites this paper
• Fast parallel molecular algorithms for DNA-based computation: factoring integers

  2005cites this paper
• Fast parallel molecular solutions for DNA-based supercomputing: the subset-product problem.

  2005cites this paper
• Fast parallel DNA-based algorithms for molecular computation: determining a prime number

  2005cites this paper
• Fast Parallel Solution for Set-Packing and Clique Problems by DNA-Based Computing

  2004influential citation
• PAPER Special Section on Hardware/Software Support for High Performance Scientific and Engineering Computing Fast Parallel Solution for Set-Packing and Clique Problems by DNA-Based Computing

  2004cites this paper