Strand design for biomolecular computation

Authors:
Arwen Brenneman;Anne Condon
Affiliations:
The Department of Computer Science, University of British Columbia, 2366 Main Mall, Vancouver, BC, Canada V6T 1Z4;The Department of Computer Science, University of British Columbia, 2366 Main Mall, Vancouver, BC, Canada V6T 1Z4
Venue:
Theoretical Computer Science - Natural computing
Year:
2002

Citing 7
Cited 16

Using simulated annealing to design good codes

IEEE Transactions on Information Theory
Molecular computation of solutions to combinatorial problems

Science
Two new bounds on the size of binary codes with a minimum distance of three

Designs, Codes and Cryptography
Universal DNA tag systems: a combinatorial design scheme

RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
Pseudoknots in RNA secondary structures

RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
PSPVM: Implementing PVM on a High-Speed Interconnect for Worstation Clusters

EuroPVM '96 Proceedings of the Third European PVM Conference on Parallel Virtual Machine
Algorithmic self-assembly of dna

Algorithmic self-assembly of dna

Linear constructions for DNA codes

Theoretical Computer Science
Hardware acceleration of multi-deme genetic algorithm for the application of DNA codeword searching

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Randomized fast design of short DNA words

ACM Transactions on Algorithms (TALG)
On codeword design in metric DNA spaces

Natural Computing: an international journal
An Ant Colony System for DNA sequence design based on thermodynamics

ACST '08 Proceedings of the Fourth IASTED International Conference on Advances in Computer Science and Technology
Hardware acceleration for thermodynamic constrained DNA code generation

DNA13'07 Proceedings of the 13th international conference on DNA computing
Efficient algorithm for testing structure freeness of finite set of biomolecular sequences

DNA'05 Proceedings of the 11th international conference on DNA Computing
Randomized fast design of short DNA words

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Exact and approximation algorithms for DNA tag set design

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Deterministic polynomial-time algorithms for designing short DNA words

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
A weighted insertion-deletion stacked pair thermodynamic metric for DNA codes

DNA'04 Proceedings of the 10th international conference on DNA computing
Testing structure freeness of regular sets of biomolecular sequences

DNA'04 Proceedings of the 10th international conference on DNA computing
Flexible word design and graph labeling

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
DNA base-code generation for reliable computing by using standard multi-objective evolutionary algorithms

Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Deterministic polynomial-time algorithms for designing short DNA words

Theoretical Computer Science
A multiobjective swarm intelligence approach based on artificial bee colony for reliable DNA sequence design

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The design of DNA or RNA strands for DNA computations poses many new questions in algorithms and coding theory. DNA strand design also arises in use of molecular bar codes to manipulate and identify individual molecules in complex chemical libraries, and to attach molecules to DNA chips. We survey several formulations of the DNA strand design problem, along with results and open questions in this area.