Skip to main content

Modular Algorithm in Tile Self-assembly Model

  • Conference paper
Innovations in Bio-inspired Computing and Applications

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 237))

  • 974 Accesses

Abstract

In this paper we propose a system computing A mod B for given n A -bit binary integer A and n B -bit binary integer B, which is the first system directly solving the modulus problem in tile assembly model. The worst-case assembly time of our system is Θ(n A (n A  − n B )) and the best-case assembly time is Θ(n A ).

Although the pre-existing division system which computes A/B can also be used to compute A mod B, the assembly time of this system is not ideal in some cases. Compared with the pre-existing division system, we achieved improved time complexity in our system. Our advantage is more significant if n A is much greater than n B .

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rothemund, P., Winfree, E.: The program-size complexity of self-assembled squares. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 459–468. ACM (2000)

    Google Scholar 

  2. Winfree, E.: Algorithmic Self-Assembly of DNA. PhD thesis, California Institute of Technology (1998)

    Google Scholar 

  3. Barish, R., Rothemund, P., Winfree, E.: Two computational primitives for algorithmic self-assembly: Copying and counting. Nano Letters 5(12), 2586–2592 (2005)

    Article  Google Scholar 

  4. Rothemund, P., Papadakis, N., Winfree, E.: Algorithmic self-assembly of dna sierpinski triangles. PLoS Biology 2(12), e424 (2004)

    Google Scholar 

  5. Brun, Y.: Solving np-complete problems in the tile assembly model. Theoretical Computer Science 395(1), 31–46 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Brun, Y.: Improving efficiency of 3-SAT-solving tile systems. In: Sakakibara, Y., Mi, Y. (eds.) DNA 16 2010. LNCS, vol. 6518, pp. 1–12. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  7. Zhang, X., Wang, Y., Chen, Z., Xu, J., Cui, G.: Arithmetic computation using self-assembly of dna tiles: subtraction and division. Progress in Natural Science 19(3), 377–388 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  8. Winfree, E., Liu, F., Wenzler, L., Seeman, N., et al.: Design and self-assembly of two-dimensional dna crystals. Nature 394(6693), 539–544 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Fang, X., Lai, X. (2014). Modular Algorithm in Tile Self-assembly Model. In: Abraham, A., Krömer, P., Snášel, V. (eds) Innovations in Bio-inspired Computing and Applications. Advances in Intelligent Systems and Computing, vol 237. Springer, Cham. https://doi.org/10.1007/978-3-319-01781-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-01781-5_13

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-01780-8

  • Online ISBN: 978-3-319-01781-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics