Skip to main content
SpringerLink
Log in
Book cover

International Conference on Unconventional Computation and Natural Computation

UCNC 2019: Unconventional Computation and Natural Computation pp 37–51Cite as

Further Properties of Self-assembly by Hairpin Formation

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11493))

Abstract

We continue the investigation of three operations on words and languages with motivations coming from DNA biochemistry, namely unbounded and bounded hairpin completion and hairpin lengthening. We first show that each of these operations can be used for replacing the third step, the most laborious one, of the solution to the CNF-SAT reported in [28]. As not all the bounded/unbounded hairpin completion or lengthening of semilinear languages remain semilinear, we study sufficient conditions for semilinear languages to preserve their semilinearity property after applying once either the bounded or unbounded hairpin completion, or lengthening. A similar approach is then started for the iterated variants of the three operations. A few open problems are finally discussed.

This work was supported by a grant of the Romanian National Authority for Scientific Research and Innovation, project number POC P-37-257. Victor Mitrana has also been supported by the Alexander von Humboldt Foundation.

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   49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   64.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

References

  1. Blattner, M., Latteux, M.: Parikh-bounded languages. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 316–323. Springer, Heidelberg (1981). https://doi.org/10.1007/3-540-10843-2_26

    Chapter  MATH  Google Scholar 

  2. Bottoni, P., Labella, A., Manca, V., Mitrana, V.: Superposition based on Watson-Crick-like complementarity. Theory Comput. Syst. 39, 503–524 (2006)

    Article  MathSciNet  Google Scholar 

  3. Castellanos, J., Mitrana, V.: Some Remarks on Hairpin and Loop Languages, Words, Semigroups, and Translations, pp. 47–59. World Scientific, Singapore (2001)

    Google Scholar 

  4. Chen, H.-L., Doty, D., Soloveichik, D.: Deterministic function computation with chemical reaction networks. Nat. Comput. 13, 517–534 (2014)

    Article  MathSciNet  Google Scholar 

  5. Cheptea, D., Martin-Vide, C., Mitrana, V.: A new operation on words suggested by DNA biochemistry: hairpin completion. In: Proceedings of Transgressive Computing, pp. 216–228 (2006)

    Google Scholar 

  6. Csuhaj-Varjú, E., Petre, I., Vaszil, G.: Self-assembly of strings and languages. Theor. Comput. Sci. 374, 74–81 (2007)

    Article  MathSciNet  Google Scholar 

  7. Deaton, R., Murphy, R., Garzon, M., Franceschetti, D.R., Stevens, S.E.: Good encodings for DNA-based solutions to combinatorial problems. In: Proceedings of DNA-Based Computers II, DIMACS Series, vol. 44, pp. 247–258 (1998)

    Google Scholar 

  8. Enaganti, S.K., Ibarra, O.H., Kari, L., Kopecki, S.: On the overlap assembly of strings and languages. Nat. Comput. 16, 175–185 (2017)

    Article  MathSciNet  Google Scholar 

  9. Garzon, M., Deaton, R., Neathery, P., Murphy, R.C., Franceschetti, D.R., Stevens, E.: On the encoding problem for DNA computing. In: Proceedings of Third DIMACS Workshop on DNA-Based Computing, University of Pennsylvania, pp. 230–237 (1997)

    Google Scholar 

  10. Garzon, M., Deaton, R., Nino, L.F., Stevens Jr., S.E., Wittner, M.: Genome encoding for DNA computing. In: Proceedings of Third Genetic Programming Conference, Madison, MI, 1998, pp. 684–690 (1998)

    Google Scholar 

  11. Ginsburg, S.: AFL with the semilinear property. J. Comput. Syst. Sci. 5, 365–396 (1971)

    Article  MathSciNet  Google Scholar 

  12. Ginsburg, S., Spanier, E.H., Henry, E.: Semigroups, Presburger formulas, and languages. Pac. J. Math. 16, 285–296 (1966)

    Article  MathSciNet  Google Scholar 

  13. Goldstine, J.: A simplified proof of Parikh’s theorem. Discrete Math. 19, 235–239 (1977)

    Article  MathSciNet  Google Scholar 

  14. Ito, M., Leupold, P., Manea, F., Mitrana, V.: Bounded hairpin completion. Inf. Comput. 209, 471–485 (2011)

    Article  MathSciNet  Google Scholar 

  15. Kari, L., Konstantinidis, S., Sosík, P., Thierrin, G.: On hairpin-free words and languages. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 296–307. Springer, Heidelberg (2005). https://doi.org/10.1007/11505877_26

    Chapter  Google Scholar 

  16. Kopczyński, E., To, A.W. : Parikh images of grammars: complexity and applications. In: Proceedings of 25th Annual IEEE Symposium on Logic in Computer Science (LICS), 2010, pp. 80–89 (2010)

    Google Scholar 

  17. Kopecki, S.: On the iterated hairpin completion. Theor. Comput. Sci. 412, 3629–3638 (2011)

    Article  MathSciNet  Google Scholar 

  18. Manea, F., Martín-Vide, C., Mitrana, V.: On some algorithmic problems regarding the hairpin completion. Discrete Appl. Math. 157, 2143–2152 (2009)

    Article  MathSciNet  Google Scholar 

  19. Manea, F., Mitrana, V., Yokomori, T.: Two complementary operations inspired by the DNA hairpin formation: completion and reduction. Theor. Comput. Sci. 410, 417–425 (2009)

    Article  MathSciNet  Google Scholar 

  20. Manea, F., Mitrana, V., Sempere, J.M.: Some remarks on superposition based on Watson-Crick-like complementarity. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 372–383. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-02737-6_30

    Chapter  Google Scholar 

  21. Manea, F., Mercas, R., Mitrana, V.: Hairpin lengthening and shortening of regular languages. In: Bordihn, H., Kutrib, M., Truthe, B. (eds.) Languages Alive. LNCS, vol. 7300, pp. 145–159. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31644-9_10

    Chapter  MATH  Google Scholar 

  22. Manea, F., Martín-Vide, C., Mitrana, V.: Hairpin lengthening: language theoretic and algorithmic results. J. Log. Comput. 25, 987–1009 (2015)

    Article  MathSciNet  Google Scholar 

  23. Oppen, D.: A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic. J. Comput. Syst. Sci. 16, 323–332 (1978)

    Article  MathSciNet  Google Scholar 

  24. Parikh, R.: On context-free languages. J. ACM 13, 570–581 (1966)

    Article  MathSciNet  Google Scholar 

  25. Păun, G., Rozenberg, G., Yokomori, T.: Hairpin languages. Intern. J. Found. Comp. Sci. 12, 837–847 (2001)

    Article  MathSciNet  Google Scholar 

  26. Rosales, J.C., García-Sánchez, P.A.: Numerical Semigroups. Springer-Verlag, New-York (2009). https://doi.org/10.1007/978-1-4419-0160-6

    Book  MATH  Google Scholar 

  27. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer-Verlag, Berlin (1997). https://doi.org/10.1007/978-3-642-59136-5

    Book  MATH  Google Scholar 

  28. Sakamoto, K., Gouzu, H., Komiya, K., Kiga, D., Yokoyama, S., Yokomori, T., Hagiya, M.: Molecular computation by DNA hairpin formation. Science 288, 1223–1226 (2000)

    Article  Google Scholar 

  29. Shikishima-Tsuji, K.: Regularity of iterative hairpin completions of crossing \((2,2)\)-words. Int. J. Found. Comput. Sci. 27, 375–390 (2016)

    Article  MathSciNet  Google Scholar 

  30. Winfree, E., Yang, X., Seeman, N.C.: Universal computation via self-assembly of DNA: some theory and experiments. In: DNA Bsed Computers II, vol. 44 of DIMACS (1999), pp. 191–213 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Potsdam, Potsdam, Germany

    Henning Bordihn

  2. Department of Information Systems, Polytechnic University of Madrid, Madrid, Spain

    Victor Mitrana

  3. Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania

    Victor Mitrana & Andrei Păun

  4. National Institute for Research and Development of Biological Science, Bucharest, Romania

    Victor Mitrana, Andrei Păun & Mihaela Păun

  5. Faculty of Administration and Business, University of Bucharest, Bucharest, Romania

    Mihaela Păun

Authors
  1. Henning Bordihn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Victor Mitrana
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrei Păun
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mihaela Păun
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Victor Mitrana .

Editor information

Editors and Affiliations

  1. University of Saskatchewan, Saskatoon, SK, Canada

    Ian McQuillan

  2. University of Electro-Communications, Tokyo, Japan

    Shinnosuke Seki

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bordihn, H., Mitrana, V., Păun, A., Păun, M. (2019). Further Properties of Self-assembly by Hairpin Formation. In: McQuillan, I., Seki, S. (eds) Unconventional Computation and Natural Computation. UCNC 2019. Lecture Notes in Computer Science(), vol 11493. Springer, Cham. https://doi.org/10.1007/978-3-030-19311-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-19311-9_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-19310-2

  • Online ISBN: 978-3-030-19311-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation