Attributes | Values |
---|
rdf:type
| |
Description
| - 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.
- 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)
- Článek zkoumá koncept slov bez vlásenek, motivovaný z oblasti biovýpočtů a bioinformatiky. Slovo je nazváno bezvlásenkové, pokud jej nelze napsat ve tvaru xvy theta(v)z, kde theta je involuce (zobrazení splňující podmínku, že theta na druhou je identita). Studujeme základní vlastnosti jazyků bez vlásenek vzhledem ke třem involucím, jež modelují chování molekul DNA. (cs)
|
Title
| - On hairpin-free words and languages
- O formálních jazycích a slovech bez vlásenek (cs)
- On hairpin-free words and languages (en)
|
skos:prefLabel
| - On hairpin-free words and languages
- O formálních jazycích a slovech bez vlásenek (cs)
- On hairpin-free words and languages (en)
|
skos:notation
| - RIV/47813059:19240/05:#0001879!RIV09-MSM-19240___
|
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| |
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/47813059:19240/05:#0001879
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - DNA computing; hairpin-free words (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...v/mistoKonaniAkce
| |
http://linked.open...i/riv/mistoVydani
| |
http://linked.open...i/riv/nazevZdroje
| - DEVELOPMENTS IN LANGUAGE THEORY
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...iv/tvurceVysledku
| - Sosík, Petr
- Kari, Lila
- Konstantinidis, Stavros
- Thierrin, Gabriel
|
http://linked.open...vavai/riv/typAkce
| |
http://linked.open.../riv/zahajeniAkce
| |
issn
| |
number of pages
| |
http://purl.org/ne...btex#hasPublisher
| |
https://schema.org/isbn
| |
http://localhost/t...ganizacniJednotka
| |