Bond-free languages: Formalizations, maximality and construction methods

Result code in IS VaVaI

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

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Bond-free languages: Formalizations, maximality and construction methods

Original language description

The problem of negative design of DNA languages is addressed, that is, properties and construction methods of large sets of words that prevent undesired bonds when used in DNA computations. We recall a few existing formalizations of the problem and thendefine the property of sim-bond-freedom, where sim is a similarity relation between words. We show that this property is decidable for context-free languages and polynomial-time decidable for regular languages. The maximality of this property also turnsout to be decidable for regular languages and polynomial-time decidable for an important case of the Hamming similarity. Then we consider various construction methods for Hamming bond-free languages, including the recently introduced method of templates,and obtain a complete structural characterization of all maximal Hamming bond-free languages. This result is applicable to the theta-k-code property introduced by Jonoska and Mahalingam.

Czech name

DNA jazyky bez vazeb: formalizace, maximalita a konstrukční metody

Czech description

Článek se věnuje problému negativního návrhu DNA jazyků, to jest, vlastnostem a konstrukci velkých množin řetězců, které neumožňují vzájemné nežádoucí vazby, jsou-li užity k DNA výpočtům. Zobecňujeme několik existujícíh formalizací tohoto problému a představujeme obecný koncept tzv. sim-bezvazebných jazyků s velmi silnými vlastnostmi

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2005

Confidentiality

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

Name of the periodical

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE

ISSN

0129-0541

e-ISSN

—

Volume of the periodical

5

Issue of the periodical within the volume

16

Country of publishing house

SG - SINGAPORE

Number of pages

32

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—