Skip to main content
SpringerLink
Log in
Book cover

International Workshop on DNA-Based Computers

DNA 2001: DNA Computing pp 381–390Cite as

A Note on Graph Splicing Languages

  • Conference paper
  • First Online:

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

Abstract

In this paper, we examine the relationship between graph splicing languages of Freund (1995) and Hyperedge replacement graph languages. We also extend the notion of self cross-over introduced by Dassow and Mitrana (1998) to graph languages and compare them with graph splicing languages.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N.G. David, F. Drewes, and H.J. Kreowski, Hyperedge Replacement with Rendezvous, Lecture Notes in Computer Science-688, 1993, 169–181.

    Google Scholar 

  2. J. Dassow and V. Mitrana, Self Cross-over Systems, In ‘Discrete Mathematics and Theoretical Computer Science’, Springer Series, G. Paun (Ed.), 1998, 283–294.

    Google Scholar 

  3. R. Freund, Splicing Systems on Graphs, Proc. Intelligence in Neural and Biological Systems, IEEE Press, 1995, 189–194.

    Google Scholar 

  4. A. Habel, Hyperedge Replacement: Grammars and Languages, Lecture Notes in Computer Science, Springer-Verlag, Berlin Heidelberg, 1992.

    MATH  Google Scholar 

  5. T. Head, Formal Language Theory and DNA: An analysis of the generative capacity of recombinant behaviours, Bulletin of Mathematical Biology, 49, 1987, 735–759.

    MathSciNet  Google Scholar 

  6. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley Pub. Co., USA, 1979.

    MATH  Google Scholar 

  7. N. Jonoska, 3D DNA Patterns and Computation, Proc. Molecular Computing, India, 1998, 20–32.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Madras Christian College, Chennai, 600059, India

    N. Gnanamalar David, K. G. Subramanian & D. Gnanaraj Thomas

Authors
  1. N. Gnanamalar David
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. G. Subramanian
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. Gnanaraj Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, University of South Florida, 4202 E. Fowler A. PHY 114, Tampa, FL, 33620, USA

    Nataša Jonoska

  2. Department of Chemistry, New York University, New York, NY, 10003, USA

    Nadrian C. Seeman

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

David, N.G., Subramanian, K.G., Thomas, D.G. (2002). A Note on Graph Splicing Languages. In: Jonoska, N., Seeman, N.C. (eds) DNA Computing. DNA 2001. Lecture Notes in Computer Science, vol 2340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48017-X_36

Download citation

  • DOI: https://doi.org/10.1007/3-540-48017-X_36

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43775-8

  • Online ISBN: 978-3-540-48017-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation