@inproceedings{390a2961eb5f45c7844f42a403b5b45e,
title = "Synthesizing minimal tile sets for patterned DNA self-assembly",
keywords = "branch-and-bound algorithm, DNA self-assembly, PATS problem, tilings, branch-and-bound algorithm, DNA self-assembly, PATS problem, tilings, branch-and-bound algorithm, DNA self-assembly, PATS problem, tilings",
author = "Mika G{\"o}{\"o}s and Pekka Orponen",
note = "VK: hiit",
year = "2011",
doi = "10.1007/978-3-642-18305-8_7",
language = "English",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "71--82",
editor = "Y. Sakakibara and Y. Mi",
booktitle = "The 16th Conference on DNA Computing and Molecular Programming (DNA16) DNA, (Hong Kong, China, June 2010)",
}