Titlebook: Aspects of Molecular Computing; Essays Dedicated to Nata?a Jonoska,Gheorghe P?un,Grzegorz Rozenberg Book 2004 Springer-Verlag Berlin Heide

巧辦法

Dignant

Writing Information into DNA,The time is approaching when information can be written into DNA. This tutorial work surveys the methods for designing code words using DNA, and proposes a simple code that avoids unwanted hybridization in the presence of shift and concatenation of DNA words and their complements.

合并

On Some Classes of Splicing Languages,We introduce some classes of splicing languages generated with simple and semi-simple splicing rules, in both, the linear and circular cases. We investigate some of their properties.

向外才掩飾

Fixed Point Approach to Commutation of Languages,We show that the maximal set commuting with a given regular set – its centralizer – can be defined as the maximal fixed point of a certain language operator. Unfortunately, however, an infinite number of iterations might be needed even in the case of finite languages.

hermetic

急性

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/163094.jpg

裁決

CRACY

On the Universality of P Systems with Minimal Symport/Antiport Rules,omputationally universal. The proof from [2] uses systems with nine membranes. In this paper we improve this results, by showing that six membranes suffice. The optimality of this result remains open (we believe that the number of membranes can be reduced by one).

多產(chǎn)魚

An Algorithm for Testing Structure Freeness of Biomolecular Sequences,ists an efficient algorithm for this problem. In this paper, we will give an efficient algorithm to check the structure freeness of . . under the constraint that every sequence may form only . secondary structures, which partially solves the open problem.

Mammal

Aspects of Molecular Computing978-3-540-24635-0Series ISSN 0302-9743 Series E-ISSN 1611-3349