Skip to main content
SpringerLink
Log in

On Codes Defined by Bio-operations

  • Conference paper
Developments in Language Theory (DLT 2004)

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

Included in the following conference series:

  • 489 Accesses

Abstract

We consider the classes of ⊕-codes and⊗-codes, which are superclasses of outfix and hypercodes, respectively. These restrictions are based on the synchronized insertion operation, which serves as a model for the gene rearrangement function in certain unicellular organisms. We investigate the classes of ⊕-codes and⊗-codes from a theoretical perspective, examine their relationships with traditional code classes and consider related decidability problems.

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. Berstel, J., Perrin, D.: Theory of Codes (1996), Available at http://www-igm.univ-mlv.fr/%7Eberstel/LivreCodes/Codes.html

  2. Daley, M., Ibarra, O., Kari, L.: Closure properties and decision questions of some language classes under ciliate bio-operations. Theor. Comp. Sci. 306(1), 19–38 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. Daley, M., Kari, L.: Some properties of ciliate bio-operations. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol. 2450, pp. 116–127. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Daley, M., Kari, L., McQuillan, I.: Families of languages defined by ciliate bio-operations. Theor. Comput. Sci. 320(1), 51–69 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  5. Domaratzki, M.: Trajectory-Based Codes. Acta Inf. 40(6–7), 491–527 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  6. Haines, L.: On free monoids partially ordered by embedding. J. Comb. Theory 6, 94–98 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  7. Harju, T., Karhumäki, J.: Morphisms. In: [17], pp. 439–510.

    Google Scholar 

  8. Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc. 2(3), 326–336 (1952)

    Article  MATH  MathSciNet  Google Scholar 

  9. Ito, M., Jürgensen, H., Shyr, H., Thierrin, G.: Outfix and infix codes and related classes of languages. J. Comp. Sys. Sci. 43, 484–508 (1991)

    Article  MATH  Google Scholar 

  10. Jürgensen, H., Konstantinidis, S.: Codes. In: [17], pp. 511–600.

    Google Scholar 

  11. Kari, L.: On language equations with invertible operations. Theor. Comput. Sci. 132, 129–150 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  12. Kari, L., Kitto, R., Thierrin, G.: Codes, involutions, and DNA encodings. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol. 2300, pp. 376–393. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. Kari, L., Konstantinidis, S., Losseva, E., Wozniak, G.: Sticky-free and overhang-free DNA languages. Acta. Inf. 40(2), 119–157 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  14. Kari, L., Konstantinidis, S., Sosík, P.: On properties of bond-free DNA languages. Technical Report 609, Computer Science Department, University of Western Ontario (Submitted for publication) (2003)

    Google Scholar 

  15. Latteux, M., Roos, Y.: Synchronized shuffle and regular languages. In: Karhumäki, J., et al. (eds.) Jewels are Forever: Contributions on Theoretical Computer Science in Honour of Arto Salomaa, pp. 35–44. Springer, Heidelberg (1999)

    Google Scholar 

  16. Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983)

    MATH  Google Scholar 

  17. Rozenberg, G., Salomaa, A.: Handbook of Formal Languages, Vol. I. Springer-Verlag, Heidelberg (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Western Ontario, London, ON, Canada

    Mark Daley

  2. Jodrey School of Computer Science, Acadia University, Wolfville, NS, Canada

    Michael Domaratzki

Authors
  1. Mark Daley
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Domaratzki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Auckland, New Zealand

    Cristian S. Calude

  2. Computer Science, Institute of Information and Mathematical Sciences, Massey University Albany, Auckland, New Zealand

    Elena Calude

  3. Department of Computer Science, University of Auckland, Private Bag 92019, Auckland, New Zealand

    Michael J. Dinneen

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Daley, M., Domaratzki, M. (2004). On Codes Defined by Bio-operations. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds) Developments in Language Theory. DLT 2004. Lecture Notes in Computer Science, vol 3340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30550-7_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30550-7_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24014-3

  • Online ISBN: 978-3-540-30550-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation