Pekka Orponen

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Mika Göös

> Home > Persons > Pekka Orponen

Publications

2014
[j29]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/GoosLCO14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/GoosLCO14
Mika Göös, Tuomo Lempiäinen, Eugen Czeizler, Pekka Orponen:
Search methods for tile sets in patterned DNA self-assembly. J. Comput. Syst. Sci. 80(1): 297-319 (2014)
[i7]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/GoosLCO14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/GoosLCO14
Mika Göös, Tuomo Lempiäinen, Eugen Czeizler, Pekka Orponen:
Search Methods for Tile Sets in Patterned DNA Self-Assembly. CoRR abs/1412.7219 (2014)
2010
[c28]
- view
  authority control:
- export record
  dblp key:
  - conf/dna/GoosO10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dna/GoosO10
Mika Göös, Pekka Orponen:
Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly. DNA 2010: 71-82
2009
[i5]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-0911-2924
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0911-2924
Mika Göös, Pekka Orponen:
Synthesizing Minimal Tile Sets for Patterned DNA Self-Assembly. CoRR abs/0911.2924 (2009)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.