{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T11:23:45Z","timestamp":1748258625392},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2002,5,8]],"date-time":"2002-05-08T00:00:00Z","timestamp":1020816000000},"content-version":"unspecified","delay-in-days":37,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2002,4]]},"abstract":"<jats:p>Ciliates have developed a unique nuclear dualism, having two nuclei of different \nfunctionality: the germline micronucleus and the somatic macronucleus. The way that \nciliates assemble the macronuclear genes after cell mating constitutes one of the most \nintricate DNA processings in living organisms. This processing is also very interesting from \nthe computational point of view. In this paper, we investigate the operations of loop excision \nand hairpin excision\/reinsertion used in the assembly process. In particular, we consider \nthree levels of formalization of this process, culminating in graph reduction systems.<\/jats:p>","DOI":"10.1017\/s0960129501003516","type":"journal-article","created":{"date-parts":[[2002,7,28]],"date-time":"2002-07-28T23:18:00Z","timestamp":1027898280000},"page":"113-134","source":"Crossref","is-referenced-by-count":32,"title":["String and graph reduction systems for gene assembly in ciliates"],"prefix":"10.1017","volume":"12","author":[{"given":"ANDRZEJ","family":"EHRENFEUCHT","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ION","family":"PETRE","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DAVID M.","family":"PRESCOTT","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GRZEGORZ","family":"ROZENBERG","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2002,5,8]]},"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129501003516","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T19:24:46Z","timestamp":1553887486000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129501003516\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0960129501003516"],"URL":"https:\/\/doi.org\/10.1017\/s0960129501003516","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}