A fast parallel algorithm for the maximal independent set problem
Journal of the ACM (JACM)
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Coding Properties of DNA Languages
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
The Fidelity of the Tag-Antitag System
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
DNASequencesGenerator: A Program for the Construction of DNA Sequences
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
In vitro selection of non-cross hybridizing oligonucleotides for computation
Natural Computing: an international journal
Codeword design and information encoding in DNA ensembles
Natural Computing: an international journal
Physical modeling of biomolecular computers: Models, limitations, and experimental validation
Natural Computing: an international journal
A DNA-based memory with in vitro learning and associative recall
Natural Computing: an international journal
On codeword design in metric DNA spaces
Natural Computing: an international journal
Sensitivity and capacity of microarray encodings
DNA'05 Proceedings of the 11th international conference on DNA Computing
In search of optimal codes for DNA computing
DNA'06 Proceedings of the 12th international conference on DNA Computing
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Characterization of non-crosshybridizing DNA oligonucleotides manufactured In Vitro
DNA'04 Proceedings of the 10th international conference on DNA computing
A weighted insertion-deletion stacked pair thermodynamic metric for DNA codes
DNA'04 Proceedings of the 10th international conference on DNA computing
Minimum basin algorithm: an effective analysis technique for DNA energy landscapes
DNA'04 Proceedings of the 10th international conference on DNA computing
The capacity of DNA for information encoding
DNA'04 Proceedings of the 10th international conference on DNA computing
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Engineering Applications of Artificial Intelligence
Improving the design of sequences for DNA computing: A multiobjective evolutionary approach
Applied Soft Computing
Hi-index | 0.00 |
Under an all or nothing hybridization model, the problem of finding a library of non-crosshybridizing DNA oligonucleotides is shown to be equivalent to finding an independent set of vertices in a graph. Individual oligonucleotides or Watson-Crick pairs are represented as vertices. Indicating a hybridization, an edge is placed between vertices (oligonu-cleotides or pairs) if the minimum free energy of hybridization, according to the nearest-neighbor model of duplex thermal stability, is less than some threshold value. Using this equivalence, an algorithm is implemented to find maximal libraries. Sequence designs were generated for a test of a modified PCR protocol. The results indicated that the designed structures formed as planned, and that there was little to no secondary structure present in the single-strands. In addition, simulations to find libraries of 10-mers and 20-mers were done, and the base composition of the non-crosshybridizing libraries was found to be 2/3 A-T and 1/3 G-C under high salt conditions, and closer to uniform for lower salt concentrations.