{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T05:15:07Z","timestamp":1735881307613,"version":"3.32.0"},"reference-count":18,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2005,6]]},"abstract":"<jats:p>We study binary word operations of the insertion, deletion and substitution type. Many of these operations can be generalized into a unified framework by introducing so-called trajectory condition. This generalization has been previously made for insertion and deletion operations. In this paper we naturally extend this approach also to substitution operations. We study closure properties and decision problems of substitutions on trajectories. The obtained results are then applied to model complex noisy channels and a cryptanalysis problem. Another application concerns the design of sets of DNA strands without undesired bonds.<\/jats:p>","DOI":"10.1142\/s0129054105003145","type":"journal-article","created":{"date-parts":[[2005,7,5]],"date-time":"2005-07-05T14:52:13Z","timestamp":1120575133000},"page":"531-546","source":"Crossref","is-referenced-by-count":2,"title":["OPERATIONS ON TRAJECTORIES WITH APPLICATIONS TO CODING AND BIOINFORMATICS"],"prefix":"10.1142","volume":"16","author":[{"given":"LILA","family":"KARI","sequence":"first","affiliation":[{"name":"Department of Computer Science, The University of Western Ontario, London, Ontario, N6A 5B7, Canada"}]},{"given":"STAVROS","family":"KONSTANTINIDIS","sequence":"additional","affiliation":[{"name":"Dept. of Mathematics and Computing Science, Saint Mary's University, Halifax, Nova Scotia, B3H 3C3, Canada"}]},{"given":"PETR","family":"SOS\u00cdK","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, Silesian University, 74601 Opava, Czech Republic"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1126\/science.7973651"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037360"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.02.031"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-004-0140-4"},{"key":"rf5","doi-asserted-by":"crossref","first-page":"349","DOI":"10.3233\/FUN-2004-59403","volume":"59","author":"Domaratzki M.","journal-title":"Fundamenta Informaticae"},{"key":"rf7","unstructured":"M.\u00a0Domaratzki, WORDS'03: 4th International Conference on Combinatorics on Words, eds. T.\u00a0Harju and J.\u00a0Karhumaki (TUCS General Publication, 2003)\u00a0pp. 309\u2013319."},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00277-7"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90230-5"},{"key":"rf14","unstructured":"L.\u00a0Kari, S.\u00a0Konstantinidis and P.\u00a0Sos\u00edk, DNA 10, Tenth International Meeting on DNA Computing, eds. C.\u00a0Feretti, G.\u00a0Mauri and C.\u00a0Zandron (University of Milano-Bicocca, 2004)\u00a0pp. 375\u2013384."},{"key":"rf16","first-page":"97","volume":"46","author":"Kari L.","journal-title":"Collect. Math."},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.3035"},{"key":"rf18","first-page":"278","volume":"8","author":"Konstantinidis T.","journal-title":"J. Universal Comp. Science"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-2156-2"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1089\/10665270152530818"},{"key":"rf21","unstructured":"A.\u00a0Mateescu, Unconvential Models of Computation, eds. C.\u00a0Calude, J.\u00a0Casti and M.\u00a0Dinneen (Springer-Verlag, Berlin, 1998)\u00a0pp. 273\u2013285."},{"key":"rf23","first-page":"145","volume":"5","author":"Mateescu A.","journal-title":"J. Automata, Languages and Combinatorics"},{"key":"rf25","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00163-1"},{"key":"rf26","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\/S0129054105003145","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T10:46:52Z","timestamp":1735814812000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054105003145"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":18,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2005,6]]}},"alternative-id":["10.1142\/S0129054105003145"],"URL":"https:\/\/doi.org\/10.1142\/s0129054105003145","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}