. "1"^^ . "3-540-26546-5" . . "[2994EFFC54E9]" . "O form\u00E1ln\u00EDch jazyc\u00EDch a slovech bez vl\u00E1senek"@cs . . . "On hairpin-free words and languages" . "Neuveden" . . . . "Konstantinidis, Stavros" . "Berlin" . "Kari, Lila" . "0302-9743" . . "Palermo" . "2005-01-01+01:00"^^ . "DEVELOPMENTS IN LANGUAGE THEORY" . . . . "Sos\u00EDk, Petr" . "On hairpin-free words and languages"@en . "534344" . "\u010Cl\u00E1nek zkoum\u00E1 koncept slov bez vl\u00E1senek, motivovan\u00FD z oblasti biov\u00FDpo\u010Dt\u016F a bioinformatiky. Slovo je nazv\u00E1no bezvl\u00E1senkov\u00E9, pokud jej nelze napsat ve tvaru xvy theta(v)z, kde theta je involuce (zobrazen\u00ED spl\u0148uj\u00EDc\u00ED podm\u00EDnku, \u017Ee theta na druhou je identita). Studujeme z\u00E1kladn\u00ED vlastnosti jazyk\u016F bez vl\u00E1senek vzhledem ke t\u0159em involuc\u00EDm, je\u017E modeluj\u00ED chov\u00E1n\u00ED molekul DNA."@cs . "The paper examines the concept of hairpin-free words motivated from the biocomputing and bioinformatics fields. Hairpin (-free) DNA structures have numerous applications to DNA computing and molecular genetics in general. A word is called hairpin-free if it cannot be written in the form xvy theta(v)z, with certain additional conditions, for an involution theta (a function theta with the property that theta(2) equals the identity function). We consider three involutions relevant to DNA computing: a) the mirror image function, b) the DNA complementarity function over the DNA alphabet {A, C, G, T} which associates A with T and C with G, and c) the Watson-Crick involution which is the composition of the previous two. We study elementary properties and finiteness of hairpin (-free) languages w.r.t. the involutions a) and c). Maximal length of hairpin-free words is also examined. Finally, descriptional complexity of maximal hairpin-free languages is determined." . "DNA computing; hairpin-free words"@en . "19240" . . "RIV/47813059:19240/05:#0001879" . "The paper examines the concept of hairpin-free words motivated from the biocomputing and bioinformatics fields. Hairpin (-free) DNA structures have numerous applications to DNA computing and molecular genetics in general. A word is called hairpin-free if it cannot be written in the form xvy theta(v)z, with certain additional conditions, for an involution theta (a function theta with the property that theta(2) equals the identity function). We consider three involutions relevant to DNA computing: a) the mirror image function, b) the DNA complementarity function over the DNA alphabet {A, C, G, T} which associates A with T and C with G, and c) the Watson-Crick involution which is the composition of the previous two. We study elementary properties and finiteness of hairpin (-free) languages w.r.t. the involutions a) and c). Maximal length of hairpin-free words is also examined. Finally, descriptional complexity of maximal hairpin-free languages is determined."@en . "RIV/47813059:19240/05:#0001879!RIV09-MSM-19240___" . "O form\u00E1ln\u00EDch jazyc\u00EDch a slovech bez vl\u00E1senek"@cs . . . "On hairpin-free words and languages" . "Thierrin, Gabriel" . "4"^^ . "S" . "On hairpin-free words and languages"@en . "12"^^ .