This HTML5 document contains 39 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n11http://localhost/temp/predkladatel/
n12http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n17http://linked.opendata.cz/ontology/domain/vavai/
n5http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F47813059%3A19240%2F05%3A%230001881%21RIV09-MSM-19240___/
shttp://schema.org/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
skoshttp://www.w3.org/2004/02/skos/core#
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n10http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F47813059%3A19240%2F05%3A%230001881%21RIV09-MSM-19240___
rdf:type
skos:Concept n17:Vysledek
dcterms:description
The input data for DNA computing must be encoded into the form of single or double DNA strands. As complementary parts of single strands can bind together forming a double-stranded DNA sequence, one has to impose restrictions on these sets of DNA words (languages) to prevent them from interacting in undesirable ways. We recall a list of known properties of DNA languages which are free of certain types of undesirable bonds. Then we introduce a general framework in which we can characterize each of these properties by a solution of a uniform formal language inequation. This characterization allows us among others to construct (i) a uniform algorithm deciding in polynomial time whether a given DNA language possesses any of the studied properties, and (ii) in many cases also an algorithm deciding whether a given DNA language is maximal with respect to the desired property. Vstupní data pro DNA výpočty musí být zakódována ve formě jedno- anebo dvouvláknových DNA molekul. Přitom je nutno dbát na to, aby tyto molekuly mezi sebou nereagovaly nežádoucím způsobem. V článku shrneme dříve studované typy DNA jazyků bez nežádoucích vazeb jistých typů. Následně představíme obecný rámec, v němž lze tyto jazyky charakterizovat, a který umožňuje konstrukci obecných a rychlých algoritmů pro jejich analýzu. The input data for DNA computing must be encoded into the form of single or double DNA strands. As complementary parts of single strands can bind together forming a double-stranded DNA sequence, one has to impose restrictions on these sets of DNA words (languages) to prevent them from interacting in undesirable ways. We recall a list of known properties of DNA languages which are free of certain types of undesirable bonds. Then we introduce a general framework in which we can characterize each of these properties by a solution of a uniform formal language inequation. This characterization allows us among others to construct (i) a uniform algorithm deciding in polynomial time whether a given DNA language possesses any of the studied properties, and (ii) in many cases also an algorithm deciding whether a given DNA language is maximal with respect to the desired property.
dcterms:title
O vlastnostech DNA jazyků bez vazeb On properties of bond-free DNA languages On properties of bond-free DNA languages
skos:prefLabel
O vlastnostech DNA jazyků bez vazeb On properties of bond-free DNA languages On properties of bond-free DNA languages
skos:notation
RIV/47813059:19240/05:#0001881!RIV09-MSM-19240___
n4:aktivita
n14:S
n4:aktivity
S
n4:cisloPeriodika
334
n4:dodaniDat
n10:2009
n4:domaciTvurceVysledku
n12:3180328
n4:druhVysledku
n16:J
n4:duvernostUdaju
n8:S
n4:entitaPredkladatele
n5:predkladatel
n4:idSjednocenehoVysledku
534393
n4:idVysledku
RIV/47813059:19240/05:#0001881
n4:jazykVysledku
n15:eng
n4:klicovaSlova
bond-free DNA languages
n4:klicoveSlovo
n6:bond-free%20DNA%20languages
n4:kodStatuVydavatele
NL - Nizozemsko
n4:kontrolniKodProRIV
[56FB0F76E98D]
n4:nazevZdroje
THEORETICAL COMPUTER SCIENCE
n4:obor
n13:IN
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
3
n4:rokUplatneniVysledku
n10:2005
n4:svazekPeriodika
1
n4:tvurceVysledku
Konstantinidis, Stavros Sosík, Petr Kari, Lila
s:issn
0304-3975
s:numberOfPages
19
n11:organizacniJednotka
19240