Skip to main content
SpringerLink
Log in

Upper Bounds for Restricted Splicing

  • Chapter
  • First Online:
Formal and Natural Computing

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

  • 306 Accesses

Abstract

We determine or improve upper bounds for non-iterated splicing in length-increasing, length-decreasing, same-length and self splicing mode.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Culik II, T. Harju. Splicing Semigroups of Dominoes and DNA, Discrete Applied Mathematics, 31:162–177, 1991.

    Article  MathSciNet  Google Scholar 

  2. R. Dassen, H.J. Hoogeboom, N. van Vugt. A Characterization of Noniterated Splicing with Regular Rules. In: Where Mathematics, Computer Science and Biology Meet (C. Martin-Vide, V. Mitrana, Eds.), Kluwer Academic Publishers, 2000, pages 319–327.

    Google Scholar 

  3. R.W. Ehrich, S.S. Yau. Two-Way Sequential Transductions and Stack Automata. Information and Control 18:404–446, 1971.

    Article  MathSciNet  MATH  Google Scholar 

  4. H. Fernau and R. Stiebe. Regulation by Valences. In: B. Rovan (Ed.) Proceedings of MFCS’97, Lecture Notes in Computer Science, vol. 1295, pages 239–248. Springer-Verlag, 1997.

    Google Scholar 

  5. H. Fernau, R. Stiebe. Sequential Grammars and Automata with Valences. Technical Report WSI-2000-25, Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, 2000. Submitted. Available via http://www.informatik.uni-tuebingen.de/bibliothek/wsi-reports.html

  6. S.A. Greibach. Remarks on Blind and Partially Blind One-Way Multicounter Machines. Theoretical Computer Science 7 (1978) 311–324.

    Article  MATH  MathSciNet  Google Scholar 

  7. T. Head, Gh. Păun, D. Pixton. Language Theory and Molecular Genetics: Generative Mechanisms Suggested by DNA Recombination. In: Handbook of Formal Languages (G. Rozenberg, A. Salomaa, Eds.), volume 2, Springer-Verlag, 1997.

    Google Scholar 

  8. J.E. Hopcroft, J.D. Ullman. Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979.

    Google Scholar 

  9. H.J. Hoogeboom, N. van Vugt. The Power of H Systems: Does Representation Matter? Computing with Bio-molecules: Theory and Experiments (G. Păun, Ed.), Springer-Verlag, Singapore, 255–268, 1998.

    Google Scholar 

  10. L. Kari, G. Păun, A. Salomaa. The Power of Restricted Splicing with Rules from a Regular Language, Journal of Universal Computer Science, 2(4):224–240, 1996.

    MATH  MathSciNet  Google Scholar 

  11. M. Latteux, B. Leguy, B. Ratoandromanana. The Family of One-Counter Languages Is Closed under Quotient, Acta Informatica 22:579–588, 1985.

    MATH  MathSciNet  Google Scholar 

  12. G. Păun. A New Generative Device: Valence Grammars. Revue Roumaine de Mathématiques Pures et Appliquées 6 (1980) 911–924.

    Google Scholar 

  13. Gh. Păun, G. Rozenberg, A. Salomaa. Computing by Splicing, Theoretical Computer Science 168:321–336, 1996.

    Article  MathSciNet  MATH  Google Scholar 

  14. Gh. Păun, G. Rozenberg, A. Salomaa. Restricted Use of the Splicing Operation, International Journal of Computer Mathematics 60:17–32, 1996.

    Article  MATH  Google Scholar 

  15. Gh. Păun, G. Rozenberg, A. Salomaa. DNA Computing. New Computing Paradigms, Springer-Verlag, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Advanced Computer Science, Universiteit Leiden, P.O. Box 9512, 2300, Leiden, RA, The Netherlands

    Hendrik Jan Hoogeboom & Nikè van Vugt

Authors
  1. Hendrik Jan Hoogeboom
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nikè van Vugt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Technical University of Munich, Arcisstraße 21, 80333, Munich, Germany

    Wilfried Brauer

  2. Computer Science Department, Technical University of Berlin, Franklinstraße 28/29, 10587, Berlin, Germany

    Hartmut Ehrig

  3. Department of Mathematics, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  4. Turku Centre for Computer Science, Lemminkäisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Hoogeboom, H.J., van Vugt, N. (2002). Upper Bounds for Restricted Splicing. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds) Formal and Natural Computing. Lecture Notes in Computer Science, vol 2300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45711-9_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-45711-9_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43190-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation