{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T18:55:15Z","timestamp":1674845715307},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2007,12]]},"abstract":"<jats:p> This paper considers an intra-molecular version of template-guided recombination (TGR), which has been studied in recent papers as an inter-molecular operation. We demonstrate that the intra-molecular TGR operations are distinct from previous intramolecular models for ciliate gene assembly, including the ld and hi operations. We examine the language-theoretic properties of intra-molecular TGR, including closure properties and solutions to language equations. <\/jats:p>","DOI":"10.1142\/s0129054107005224","type":"journal-article","created":{"date-parts":[[2007,10,29]],"date-time":"2007-10-29T03:37:41Z","timestamp":1193629061000},"page":"1177-1186","source":"Crossref","is-referenced-by-count":6,"title":["INTRA-MOLECULAR TEMPLATE-GUIDED RECOMBINATION"],"prefix":"10.1142","volume":"18","author":[{"given":"MARK","family":"DALEY","sequence":"first","affiliation":[{"name":"Departments of Computer Science and Biology, University of Western Ontario, London, ON, N6A 5B7, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MICHAEL","family":"DOMARATZKI","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Manitoba, Winnipeg, MB, R3T 2T2, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ALEXIS","family":"MORRIS","sequence":"additional","affiliation":[{"name":"School of Informatics, University of Edinburgh, Edinburgh, EH8 9LE, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00139-7"},{"key":"rf2","first-page":"477","volume":"8","author":"Daley M.","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.03.043"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.06.028"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1007\/11753681_3"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-005-1206-6"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054105003212"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-06371-2"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-5193(03)00037-7"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59126-6"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054107005224","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:42:44Z","timestamp":1565124164000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054107005224"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":10,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2007,12]]}},"alternative-id":["10.1142\/S0129054107005224"],"URL":"https:\/\/doi.org\/10.1142\/s0129054107005224","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12]]}}}