About: On properties of bond-free DNA languages     Goto   Sponge   Distinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • 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. (cs)
  • 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.
  • 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. (en)
Title
  • On properties of bond-free DNA languages
  • O vlastnostech DNA jazyků bez vazeb (cs)
  • On properties of bond-free DNA languages (en)
skos:prefLabel
  • On properties of bond-free DNA languages
  • O vlastnostech DNA jazyků bez vazeb (cs)
  • On properties of bond-free DNA languages (en)
skos:notation
  • RIV/47813059:19240/05:#0001881!RIV09-MSM-19240___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • S
http://linked.open...iv/cisloPeriodika
  • 334
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
  • 534393
http://linked.open...ai/riv/idVysledku
  • RIV/47813059:19240/05:#0001881
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • bond-free DNA languages (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • NL - Nizozemsko
http://linked.open...ontrolniKodProRIV
  • [56FB0F76E98D]
http://linked.open...i/riv/nazevZdroje
  • THEORETICAL COMPUTER SCIENCE
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 1
http://linked.open...iv/tvurceVysledku
  • Sosík, Petr
  • Kari, Lila
  • Konstantinidis, Stavros
issn
  • 0304-3975
number of pages
http://localhost/t...ganizacniJednotka
  • 19240
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 75 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software