Skip to main content
SpringerLink
Log in

Circular DNA and splicing systems

  • Communications
  • Conference paper
  • First Online:
Parallel Image Analysis (ICPIA 1992)

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

Included in the following conference series:

Abstract

Circular strings representing DNA molecules and certain recombinant behaviour are formalized. Various actions of splicing schemes on linear and circular DNA molecules are examined. It is shown that there is a difference in the regularity result of Culik and Harju [1] between the linear and circular strings. A consequence of this result is that a conjecture of Head [4] that the circular string language of a splicing system under an action on circular strings is regular, when the set of initial circular strings is regular, is disproved.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Culik II and T. Harju (1991), The regularity of splicing systems and DNA, Discrete Applied Mathematics 31, 261–277.

    Google Scholar 

  2. R.W. Gatterdam (1989), Splicing systems and regularity, Int. J. Comp. Math., 31, 63–67.

    Google Scholar 

  3. T. Head (1987), Formal language theory and DNA: Analysis of the generative capacity of specific recombinant behaviours, Bull. Math. Bio., 49, 737–759.

    Google Scholar 

  4. T. Head (1991), Splicing schemes and DNA, manuscript.

    Google Scholar 

  5. B. Lewin (1990), Genes IV, New York, Oxford Univ. Press.

    Google Scholar 

  6. A. Rosenfeld (1975), A note on cycle grammars, Inform. Contr. 27, 374–377.

    Article  Google Scholar 

  7. G. Siromoney (1985), Studies on the traditional art of Kolam, Working paper, May 1985.

    Google Scholar 

  8. G. Siromoney and R. Siromoney, (1987), Rosenfeld's cycle grammars and Kolam in Graph-grammars and application to Computer Science, Lecture Notes in Computer Science, 291, Springer-Verlag.

    Google Scholar 

  9. G. Siromoney, R. Sirmoney and T. Robinson (1989), Kambi Kolam and Cycle grammars, In A Perspective in Theoretical Computer Science — Commemorative Volume for Gift Siromoney, Ed. R. Narasimhan, World Scientific, 267–300.

    Google Scholar 

  10. R. Siromoney (1969), On Equal Matrix Languages, Inform. Contr. 14, 135–151.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Madras Christian College, 600 059, Tambaram, Madras, India

    Rani Siromoney, K. G. Suhramanian & V. Rajkumar Dare

Authors
  1. Rani Siromoney
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. G. Suhramanian
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. Rajkumar Dare
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Akira Nakamura Maurice Nivat Ahmed Saoudi Patrick S. P. Wang Katsushi Inoue

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Siromoney, R., Suhramanian, K.G., Dare, V.R. (1992). Circular DNA and splicing systems. In: Nakamura, A., Nivat, M., Saoudi, A., Wang, P.S.P., Inoue, K. (eds) Parallel Image Analysis. ICPIA 1992. Lecture Notes in Computer Science, vol 654. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56346-6_44

Download citation

  • DOI: https://doi.org/10.1007/3-540-56346-6_44

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56346-4

  • Online ISBN: 978-3-540-47538-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation