Skip to main content
SpringerLink
Log in
Book cover

DNA Computing

10th International Workshop on DNA Computing, DNA10, Milan, Italy, June 7-10, 2004, Revised Selected Papers

  • Conference proceedings
  • © 2005

Overview

Editors:
  1. Claudio Ferretti

    1. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano – Bicocca, Milano, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Giancarlo Mauri

    1. Complex Systems and Artificial Intelligence Research Center, University of Milan–Bicocca, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Claudio Zandron

    1. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano – Bicocca, Milano, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3384)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: DNA 2004.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (39 papers)

  1. Front Matter

    Download chapter PDF

  2. Computing by Observing Bio-systems: The Case of Sticker Systems

    • Artiom Alhazov, Matteo Cavaliere
    Pages 1-13

  3. DNA-Based Computation Times

    • Yuliy Baryshnikov, Ed Coffman, Petar Momčilović
    Pages 14-23

  4. Computing Beyond the Turing Limit Using the H Systems

    • Cezar Câmpeanu, Andrei Păun
    Pages 24-34

  5. Biomolecular Implementation of Computing Devices with Unbounded Memory

    • Matteo Cavaliere, Nataša Jonoska, Sivan Yogev, Ron Piran, Ehud Keinan, Nadrian C. Seeman
    Pages 35-49

  6. Characterization of Non-crosshybridizing DNA Oligonucleotides Manufactured In Vitro

    • Junghuei Chen, Russell Deaton, Max H. Garzon, Jin Woo Kim, David Wood, Hong Bi et al.
    Pages 50-61

  7. Error Free Self-assembly Using Error Prone Tiles

    • Ho-Lin Chen, Ashish Goel
    Pages 62-75

  8. On the Computational Complexity of P Automata

    • Erzsébet Csuhaj-Varjú, Oscar H. Ibarra, György Vaszil
    Pages 76-89

  9. A Weighted Insertion-Deletion Stacked Pair Thermodynamic Metric for DNA Codes

    • Arkadii G. D’yachkov, Anthony J. Macula, Wendy K. Pogozelski, Thomas E. Renz, Vyacheslav V. Rykov, David C. Torney
    Pages 90-103

  10. DNA Extraction by XPCR

    • Giuditta Franco, Cinzia Giagulli, Carlo Laudanna, Vincenzo Manca
    Pages 104-112

  11. A Method of Error Suppression for Self-assembling DNA Tiles

    • Kenichi Fujibayashi, Satoshi Murata
    Pages 113-127

  12. Using Automated Reasoning Systems on Molecular Computing

    • Carmen Graciani Díaz, Mario J. Pérez-Jiménez
    Pages 128-137

  13. Parallelism in Gene Assembly

    • Tero Harju, Chang Li, Ion Petre, Grzegorz Rozenberg
    Pages 138-148

  14. Splicing Systems for Universal Turing Machines

    • Tero Harju, Maurice Margenstern
    Pages 149-158

  15. Application of Mismatch Detection Methods in DNA Computing

    • Christiaan V. Henkel, Grzegorz Rozenberg, Herman P. Spaink
    Pages 159-168

  16. Bond-Free Languages: Formalizations, Maximality and Construction Methods

    • Lila Kari, Stavros Konstantinidis, Petr Sosík
    Pages 169-181

  17. Preventing Undesirable Bonds Between DNA Codewords

    • Lila Kari, Stavros Konstantinidis, Petr Sosík
    Pages 182-191

  18. Testing Structure Freeness of Regular Sets of Biomolecular Sequences

    • Satoshi Kobayashi
    Pages 192-201

  19. Minimum Basin Algorithm: An Effective Analysis Technique for DNA Energy Landscapes

    • Mitsuhiro Kubota, Masami Hagiya
    Pages 202-214

  20. Efficient Initial Pool Generation for Weighted Graph Problems Using Parallel Overlap Assembly

    • Ji Youn Lee, Hee-Woong Lim, Suk-In Yoo, Byoung-Tak Zhang, Tai Hyun Park
    Pages 215-223
Back to top

Other volumes

  1. DNA Computing

Keywords

Editors and Affiliations

  • Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano – Bicocca, Milano, Italy

    Claudio Ferretti, Claudio Zandron

  • Complex Systems and Artificial Intelligence Research Center, University of Milan–Bicocca, Italy

    Giancarlo Mauri

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation