Some properties of ciliate bio-operations

  • Authors:

  • Mark Daley;Lila Kari

  • Affiliations:

  • Department of Computer Science, University of Western Ontario, London, ON, Canada;Department of Computer Science, University of Western Ontario, London, ON, Canada

  • Venue:
  • DLT'02 Proceedings of the 6th international conference on Developments in language theory
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

The process of gene unscrambling in ciliates (a type of unicellular protozoa), which accomplishes the difficult task of re-arranging gene segments in the correct order and deleting non-coding sequences from an "encrypted" version of a DNA strand, has been modeled and studied so far from the point of view of the computational power of the DNA bio-operations involved. Here we concentrate on a different aspect of the process, by considering only the linear version of the bio-operations, that do not involve thus any circular strands, and by studying the resulting formal operations from a purely language theoretic point of view. We namely investigate closure operations of language families under the mentioned bio-operations and study language equations involving them. Among the problems addressed, we study the decidability of existence of solutions to equations of the form L ◊ Y = R, X ◊ L = R where L and R are given languages, X and Y are unknowns, and ◊ signifies one of the defined bio-operations.