O vlastnostech DNA jazyků bez vazeb

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F05%3A%230001881" target="_blank" >RIV/47813059:19240/05:#0001881 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

On properties of bond-free DNA languages

Popis výsledku v původním jazyce

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 theseproperties 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.

Název v anglickém jazyce

On properties of bond-free DNA languages

Popis výsledku anglicky

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 theseproperties 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.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2005

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

THEORETICAL COMPUTER SCIENCE

ISSN

0304-3975

e-ISSN

—

Svazek periodika

1

Číslo periodika v rámci svazku

334

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

19

Strana od-do

—

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—