Boundary Components of Thickened Graphs | SpringerLink
Skip to main content

Boundary Components of Thickened Graphs

  • Conference paper
  • First Online:
DNA Computing (DNA 2001)

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

Included in the following conference series:

Abstract

Using linear DNA segments and branched junction molecules many different three-dimensional DNA structures (graphs) could be self-assembled. We investigate maximum and minimum numbers of circular DNA that form these structures. For a given graph G, we consider compact orientable surfaces, called thickened graphs of G, that have G as a deformation retract. The number of boundary curves of a thickened graph G corresponds to the number of circular DNA strands that assemble into the graph G. We investigate how this number changes by recombinations or edge additions and relate to some results from topological graph theory.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Archdeacon, Topological graph theory, a survey, Congressus Numerantium 115 (1996), 5–54.

    MATH  MathSciNet  Google Scholar 

  2. G. Chartrand and L. Lesniak, Graphs and Digraphs, Third Edition, Chapman and Hall, London, 1996.

    MATH  Google Scholar 

  3. N.R. Cozzarelli, The structure and function of DNA supercoiling and catenanes, The Harvey Lecture Series, 87 (1993) 35–55.

    Google Scholar 

  4. N. Jonoska, S. Karl, and M. Saito, Creating 3-dimensional graph structures with DNA, in DNA computers III, eds. H. Rubin and D. Wood, AMS DIMACS series, vol. 48, 123–135, (1999).

    Google Scholar 

  5. N. Jonoska, S. Karl, M. Saito, Three dimensional DNA structures in computing, BioSystems, 52, 143–153, (1999).

    Article  Google Scholar 

  6. L. H. Kauffman, Knots and Physics, World Scientific, Series on knots and everything, vol. 1, 1991.

    Google Scholar 

  7. J. R. Munkres, Topology, a first course, Prentice-Hall, 1975.

    Google Scholar 

  8. J. R. Munkres, Elements of Algebraic Topology, Addison-Wesley Publ. Co., 1994.

    Google Scholar 

  9. Rolfsen, D., Knots and Links. Publish or Perish Press, (Berkley 1976).

    MATH  Google Scholar 

  10. N.C. Seeman, Physical Models for Exploring DNA Topology. Journal of Biomolecular Structure and Dynamics 5, 997–1004 (1988).

    Google Scholar 

  11. N.C. Seeman, Construction of Three-Dimensional Stick Figures From Branched DNA, DNA and Cell Biology 10 (1991), No. 7, 475–486.

    Article  Google Scholar 

  12. N.C. Seeman, The design of single-stranded nucleic acid knots, Molecular Engineering 2, 297–307, (1992).

    Article  Google Scholar 

  13. N. C. Seeman, Y. Zhang, S.M. Du and J. Chen, Construction of DNA polyhedra and knots through symmetry minimization, Supermolecular Stereochemistry, J. S. Siegel, ed., (1995), 27–32.

    Google Scholar 

  14. D.W. Sumners, ed., New Scientific Applications of Geometry and Topology, Proc. of Symposia in Applied Mathematics, Vol. 45, A.M.S., (1992).

    Google Scholar 

  15. J.W.T. Youngs, Minimal Imbeddings and the genus of a graph, J. of Math. Mech., vol. 12, (1963), 303–315.

    MATH  MathSciNet  Google Scholar 

  16. S. A. Wasserman and N. R. Cozzarelli, Biochemical Topology: Applications to DNA recombination and replication. Science, vol. 232, (1986), 951–960.

    Article  Google Scholar 

  17. E. Winfree, X. Yang, N.C. Seeman, Universal Computation via Self-assembry of DNA: Some Theory and Experiments. in DNA computers II, eds. L. Landweber and E. Baum, AMS DIMACS series, vol. 44, 191–214 (1998).

    Google Scholar 

  18. Winfree, F. Liu, L. A. Wenzler, and N.C. Seeman, Design and Self-Assembly of Two-Dimensional DNA Crystals, Nature 394 (1998), 539–544.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jonoska, N., Saito, M. (2002). Boundary Components of Thickened Graphs. 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_7

Download citation

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

  • 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