{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T18:50:13Z","timestamp":1674845413627},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2006,4]]},"abstract":"<jats:p> We study the problem of covering a word f by a set F of available segments. In particular we demonstrate that each F induces a unique structure (scaffold) on f which determines how all \"succint\" coverings of f (by elements of F) are positioned on f. Our motivation for this study comes from the formalization of the template\u2013guided recombination which is a molecular operation that provides a solution for a molecular implementation of gene assembly in ciliates. <\/jats:p>","DOI":"10.1142\/s0129054106003930","type":"journal-article","created":{"date-parts":[[2006,4,3]],"date-time":"2006-04-03T09:47:03Z","timestamp":1144057623000},"page":"475-488","source":"Crossref","is-referenced-by-count":4,"title":["COVERS FROM TEMPLATES"],"prefix":"10.1142","volume":"17","author":[{"given":"A.","family":"EHRENFEUCHT","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Colorado at Boulder, Boulder, CO 80309, U.S.A."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"ROZENBERG","sequence":"additional","affiliation":[{"name":"Leiden Institute of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333 CA Leiden, The Netherlands"},{"name":"Department of Computer Science, University of Colorado at Boulder, Boulder, CO 80309, U.S.A."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/3-540-45007-6_9","volume":"2710","author":"Anselmo M.","year":"2003"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-06371-2"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01955677"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01188580"},{"key":"rf6","first-page":"333","volume":"4","author":"Madonia M.","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-5193(03)00037-7"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1126\/science.280.5369.1540"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054106003930","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:28:47Z","timestamp":1565191727000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106003930"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4]]},"references-count":7,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,4]]}},"alternative-id":["10.1142\/S0129054106003930"],"URL":"https:\/\/doi.org\/10.1142\/s0129054106003930","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,4]]}}}