Abstract
In chemistry, synthesis is the process in which a target compound is produced in a step-wise manner from given base compounds. A recent, promising approach for carrying out these reactions is DNA-templated synthesis, since, as opposed to more traditional methods, this approach leads to a much higher effective molarity and makes much desired one-pot synthesis possible. With this method, compounds are tagged with DNA sequences and reactions can be controlled by bringing two compounds together via their tags. This leads to new cost optimization problems of minimizing the number of different tags or strands to be used under various conditions. We identify relevant optimization criteria, provide the first computational approach to automatically inferring DNA-templated programs, and obtain optimal and near-optimal results.
Original language | English |
---|---|
Title of host publication | 23rd International Conference on DNA Computing and Molecular Programming |
Editors | Robert Brijder, Lulu Qian |
Publisher | Springer |
Publication date | 2017 |
Pages | 17-32 |
ISBN (Print) | 978-3-319-66798-0 |
ISBN (Electronic) | 978-3-319-66799-7 |
DOIs | |
Publication status | Published - 2017 |
Event | 23rd International Conference on DNA Computing and Molecular Programming - Austin, United States Duration: 24. Sept 2017 → 28. Sept 2017 Conference number: 23 |
Conference
Conference | 23rd International Conference on DNA Computing and Molecular Programming |
---|---|
Number | 23 |
Country/Territory | United States |
City | Austin |
Period | 24/09/2017 → 28/09/2017 |
Series | Lecture Notes in Computer Science |
---|---|
Volume | 10467 |
ISSN | 0302-9743 |