Strand design for biomolecular computation
Theoretical Computer Science - Natural computing
DNA sequence design using templates
New Generation Computing
Stochastic Local Search Algorithms for DNA Word Design
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
On Template Method for DNA Sequence Design
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Codeword design and information encoding in DNA ensembles
Natural Computing: an international journal
Randomized fast design of short DNA words
ACM Transactions on Algorithms (TALG)
Problems on RNA secondary structure prediction and design
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Randomized fast design of short DNA words
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
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
Flexible word design and graph labeling
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Deterministic polynomial-time algorithms for designing short DNA words
Theoretical Computer Science
Hi-index | 0.00 |
Custom-designed DNA arrays offer the possibility of simultaneously monitoring thousands of hybridization reactions These arrays show great potential for many medical and scientific applications such as polymorphism analysis and genotyping. Relatively high costs are associated with the need to specifically design and synthesize problem specific arrays. Recently, an alternative approach was suggested that utilizes fixed, universal arrays. This approach presents an interesting design problem—the arrays should contain as many probes as possible, while minimizing experimental errors caused by cross-hybridization. We use a simple thermodynamic model to cast this design problem in a formal mathematical framework. Employing new combinatorial ideas, we derive an efficient construction for the design problem, and prove that our construction is near-optimal.