08.01.2013 Views

LNCS 2950 - Aspects of Molecular Computing (Frontmatter Pages)

LNCS 2950 - Aspects of Molecular Computing (Frontmatter Pages)

LNCS 2950 - Aspects of Molecular Computing (Frontmatter Pages)

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Formal Properties <strong>of</strong> Gene Assembly 211<br />

holds: v2 = wu2, andthenalsou1 = v1w. Sinceγu = γv, the substring w must<br />

be a legal string (if only one occurrence <strong>of</strong> a pointer p is in w, thenκ would<br />

overlap with p either in u or v, but not in both). Now<br />

u = v1wκ ′ u2(κ − 1)κ and v = v1 κ ′ wu2(κ − 1)κ.<br />

By the form <strong>of</strong> the substrings wκ ′ in u and κ ′ w in v in the above, w must be<br />

an image ϱκ(α) =w for some α ∈ Θ � κ−2. By Lemma 1, dom(w) =[p, q] forsome<br />

pointers p ≤ q, and by Lemma 2(ii), either w = w ′ q or w = qw ′ for a substring<br />

w ′ . Moreover, as shown in the pro<strong>of</strong> <strong>of</strong> Lemma 2, in the former case w(q +1)<br />

is a substring <strong>of</strong> both u and v and in the latter case, (q +1)w is a substring <strong>of</strong><br />

both u and v. It then follows that q = κ − 1, and so ϱκ(Mκ−1) occurs twice in<br />

u and v - this is impossible since u and v are realistic. ✷<br />

Acknowledgements. Research supported partly by the MolCoNet project,<br />

IST-2001-32008. T. Harju gratefully acknowledges the support <strong>of</strong> the Academy<br />

<strong>of</strong> Finland under project 39802. G. Rozenberg gratefully acknowledges partial<br />

support by NSF grant 0121422.<br />

References<br />

1. Bouchet, A., Circle graphs. Combinatorica 7 (1987), 243–254.<br />

2. Bouchet, A., Circle graph obstructions. J. Combin. Theory Ser. B 60 (1994), 107–<br />

144.<br />

3. de Fraysseix, H., A characterization <strong>of</strong> circle graphs. European J. Combin. 5 (1984),<br />

223–238.<br />

4. Ehrenfeucht, A., Harju, T., Petre, I., Prescott, D. M., and Rozenberg, G., Formal<br />

systems for gene assembly in ciliates. Theoret. Comput. Sci. 292 (2003), 199–219.<br />

5. Ehrenfeucht, A., Harju, T., Petre, I., and Rozenberg, G., Characterizing the micronuclear<br />

gene patterns in ciliates. Theory <strong>of</strong> Computation and Systems 35 (2002),<br />

501–519.<br />

6. Ehrenfeucht, A., Harju, T., and Rozenberg, G., Gene assembly through cyclic graph<br />

decomposition. Theoretic Comput. Syst. 281 (2002), 325–349.<br />

7. Ehrenfeucht, A., Petre, I., Prescott, D. M., and Rozenberg, G., Universal and<br />

simple operations for gene assembly in ciliates. In Words, Sequences, Languages:<br />

Where Computer Science, Biology and Linguistics Meet, V.Mitrana,C.Martin-<br />

Vide (eds.), Kluwer Academic Publishers, Dortrecht/Boston, 329–342, 2001.<br />

8. Ehrenfeucht, A., Petre, I., Prescott, D. M., and Rozenberg, G., String and graph<br />

reduction systems for gene assembly in ciliates. Math. Structures Comput. Sci. 12<br />

(2001), 113–134.<br />

9. Ehrenfeucht, A., Petre, I., Prescott, D. M., and Rozenberg, G., Circularity and<br />

other invariants <strong>of</strong> gene assembly in cliates. In Words, Semigroups, and Transductions,<br />

M.Ito,Gh.Păun, S. Yu (eds.), World Scientific, Singapore, 81–97, 2001.<br />

10. Ehrenfeucht, A., Prescott, D. M., and Rozenberg, G., Computational aspects<br />

<strong>of</strong> gene (un)scrambling in ciliates. In Evolution as Computation, L. Landweber,<br />

E. Winfree (eds.), 45–86, Springer-Verlag, Berlin, Heidelberg, 2001.<br />

11. Harju, T. and Rozenberg, G., Computational processes in living cells: gene assembly<br />

in ciliates. Lecure Notes in Comput. Sci., toappear.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!