@article{
    GLCO14_orponen,
    author = "Göös, Mika and Lempiäinen, Tuomo and Czeizler, Eugen and Orponen, Pekka",
    responsibleauthor = "Göös, Mika and Lempiäinen, Tuomo and Czeizler, Eugen and Orponen, Pekka",
    doi = "10.1016/j.jcss.2013.08.003",
    language = "eng",
    title = "Search methods for tile sets in patterned {DNA} self-assembly",
    journal = "Journal of Computer and System Sciences",
    issn = "0022-0000",
    number = "1",
    abstract = "The Pattern self-Assembly Tile set Synthesis (PATS) problem, which arises in the theory of structured DNA self-assembly, is to determine a set of coloured tiles that, starting from a bordering seed structure, self-assembles to a given rectangular colour pattern. The task of finding minimum-size tile sets is known to be NP-hard. We explore several complete and incomplete search techniques for finding minimal, or at least small, tile sets and also assess the reliability of the solutions obtained according to Winfree's kinetic Tile Assembly Model.",
    month = "February",
    volume = "80",
    juforank = "3",
    il = "no",
    year = "2014",
    keywords = "{DNA} self-assembly, tilings {T}ile {A}ssembly {M}odel, pattern assembly, tile set synthesis, reliable self-assembly",
    unitcode = "T306-80, T312-20",
    kay = "NA",
    impactfactor = "A1",
    pages = "297-319",
    flags = "copy public HIIT"
}