DNA Computing

11th International Workshop on DNA Computing, DNA11, London, ON, Canada, June 6-9, 2005. Revised Selected Papers.

  • Alessandra Carbone
  • Niles A. Pierce
Conference proceedings DNA 2005

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

Table of contents

  1. Front Matter
    PDF
  2. Self-correcting Self-assembly: Growth Models and the Hammersley Process
    Yuliy Baryshnikov, Ed Coffman, Nadrian Seeman, Teddy Yimwadsana
    Pages 1-11
  3. Recognizing DNA Splicing
    Matteo Cavaliere, Nataša Jonoska, Peter Leupold
    Pages 12-26
  4. On Computational Properties of Template-Guided DNA Recombination
    Mark Daley, Ian McQuillan
    Pages 27-37
  5. Towards Practical Biomolecular Computers Using Microfluidic Deoxyribozyme Logic Gate Networks
    Joseph Farfel, Darko Stefanovic
    Pages 38-54
  6. DNA Recombination by XPCR
    Giuditta Franco, Vincenzo Manca, Cinzia Giagulli, Carlo Laudanna
    Pages 55-66
  7. An Algorithm for SAT Without an Extraction Phase
    Pierluigi Frisco, Christiaan Henkel, Szabolcs Tengely
    Pages 67-80
  8. Sensitivity and Capacity of Microarray Encodings
    Max H. Garzon, Vinhthuy Phan, Kiran C. Bobba, Raghuver Kontham
    Pages 81-95
  9. Simple Operations for Gene Assembly
    Tero Harju, Ion Petre, Vladimir Rogojin, Grzegorz Rozenberg
    Pages 96-111
  10. Counting Time in Computing with Cells
    Oscar H. Ibarra, Andrei Păun
    Pages 112-128
  11. On Bounded Symport/Antiport P Systems
    Oscar H. Ibarra, Sara Woodworth
    Pages 129-143
  12. Expectation and Variance of Self-assembled Graph Structures
    Nataša Jonoska, Gregory L. McColm, Ana Staninska
    Pages 144-157
  13. Hairpin Structures in DNA Words
    Lila Kari, Stavros Konstantinidis, Elena Losseva, Petr Sosík, Gabriel Thierrin
    Pages 158-170
  14. Efficient Algorithm for Testing Structure Freeness of Finite Set of Biomolecular Sequences
    Atsushi Kijima, Satoshi Kobayashi
    Pages 171-180
  15. Communicating Distributed H Systems: Optimal Results with Efficient Ways of Communication
    Shankara Narayanan Krishna
    Pages 181-192
  16. Intensive In Vitro Experiments of Implementing and Executing Finite Automata in Test Tube
    Junna Kuramochi, Yasubumi Sakakibara
    Pages 193-202
  17. Development of an In Vivo Computer Based on Escherichia coli
    Hirotaka Nakagawa, Kensaku Sakamoto, Yasubumi Sakakibara
    Pages 203-212
  18. Control of DNA Molecules on a Microscopic Bead Using Optical Techniques for Photonic DNA Memory
    Yusuke Ogura, Taro Beppu, Masahiro Takinoue, Akira Suyama, Jun Tanida
    Pages 213-223
  19. Linearizer and Doubler : Two Mappings to Unify Molecular Computing Models Based on DNA Complementarity
    Kaoru Onodera, Takashi Yokomori
    Pages 224-235
  20. Analysis and Simulation of Dynamics in Probabilistic P Systems
    Dario Pescini, Daniela Besozzi, Claudio Zandron, Giancarlo Mauri
    Pages 236-247

About these proceedings

Keywords

DNA algorithms DNA coding DNA computers DNA computing Erfüllbarkeitsproblem der Aussagenlogik algorithms automata bio-inspired computing biomolecular computing coding theory communication complexity learning molecular computing nanotechnology

Editors and affiliations

  • Alessandra Carbone
    • 1
  • Niles A. Pierce
    • 2
  1. 1.Department of Computer ScienceUniversité Pierre et Marie Curie, INSERM U511,ParisFrance
  2. 2.California Institute of Technology, Applied and Computational Mathematics, Bioengineering,PasadenaUSA

Bibliographic information

  • DOI https://doi.org/10.1007/11753681
  • Copyright Information Springer-Verlag Berlin Heidelberg 2006
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-34161-1
  • Online ISBN 978-3-540-34165-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book