標(biāo)題: Titlebook: Aspects of Molecular Computing; Essays Dedicated to Nata?a Jonoska,Gheorghe P?un,Grzegorz Rozenberg Book 2004 Springer-Verlag Berlin Heide [打印本頁] 作者: 無限 時(shí)間: 2025-3-21 16:22
書目名稱Aspects of Molecular Computing影響因子(影響力)
書目名稱Aspects of Molecular Computing影響因子(影響力)學(xué)科排名
書目名稱Aspects of Molecular Computing網(wǎng)絡(luò)公開度
書目名稱Aspects of Molecular Computing網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Aspects of Molecular Computing被引頻次
書目名稱Aspects of Molecular Computing被引頻次學(xué)科排名
書目名稱Aspects of Molecular Computing年度引用
書目名稱Aspects of Molecular Computing年度引用學(xué)科排名
書目名稱Aspects of Molecular Computing讀者反饋
書目名稱Aspects of Molecular Computing讀者反饋學(xué)科排名
作者: patella 時(shí)間: 2025-3-22 00:06
Flexibilit?t in logistischen Systemenh an intrinsic property to automatically balance the weights on their left, right pans. If we start with certain fixed weights (representing .) on some of the pans, then the balance–like components would vigorously try to balance themselves by filling the rest of the pans with suitable weights (repr作者: 結(jié)果 時(shí)間: 2025-3-22 03:06
Flexibilit?t in logistischen Systemenne, is introduced. A parallel variant of EOP systems, called EOPP systems, is also defined and the power of both EOP and EOPP systems is investigated in relationship with three parameters: number of membranes, states and set of distributed rules. It is proven that the family of Parikh sets of vector作者: 欺騙手段 時(shí)間: 2025-3-22 08:32
,Ma?nahmen zur optimalen Fl?chenausnützung,s the way that chemists use tiling in nanotechnology, where the aim is to propose building blocks and experimental protocols suitable for the construction of 1D, 2D and 3D macromolecular assembly. We shall especially concentrate on DNA nanotechnology, which has been demonstrated in recent years to b作者: WAIL 時(shí)間: 2025-3-22 11:29 作者: bifurcate 時(shí)間: 2025-3-22 15:09
https://doi.org/10.1007/978-3-642-48439-1 the encoding problem for DNA languages: one is based on a relativization of concepts related to comma free codes, the other is a generalization to any given mapping . of the notion of words appearing as substrings of others. Our first results show which parts of these two formalisms are in fact equ作者: 放棄 時(shí)間: 2025-3-22 18:08
,Flexibilit?t als Handlungsmerkmal,st tube systems communicating by applying splicing rules of some restricted type are shown to be equivalent to a variant of splicing test tube systems using a corresponding restricted type of splicing rules. Both variants of test tube systems using splicing rules are proved to be equivalent to membr作者: 地牢 時(shí)間: 2025-3-23 00:32
,Arbeitsmarkttheoretische Erkl?rungsans?tze,ridization. First, a Gibbs energy analysis of codeword sets is obtained by using a template and extant error-correcting codes. Template-based codes have too low Gibbs energies that allow cross-hybridization. Second, a new technique is presented to construct arbitrarily large sets of noncrosshybridiz作者: 沖突 時(shí)間: 2025-3-23 02:29 作者: Maximizer 時(shí)間: 2025-3-23 08:52
,Arbeitsmarkttheoretische Erkl?rungsans?tze,ill be present at this final stage. In language theoretic terms the splicing procedure is modeled as an H system, and the molecules that we want to consider correspond to a subset of the splicing language which we call the .. We give a number of examples, including one based on differential equation作者: integrated 時(shí)間: 2025-3-23 10:54 作者: Organonitrile 時(shí)間: 2025-3-23 17:33 作者: Hemodialysis 時(shí)間: 2025-3-23 19:23 作者: HEW 時(shí)間: 2025-3-23 23:39
https://doi.org/10.1007/978-3-531-90389-7sociated with a natural involution mapping ., .?. and .?. which is an antimorphism of Δ.. In order to avoid undesirable Watson-Crick bonds between the words (undesirable hybridization), the language has to satisfy certain coding properties. In this paper we build upon an earlier initiated study and 作者: stress-test 時(shí)間: 2025-3-24 04:32
,Arbeitsmarkttheoretische Erkl?rungsans?tze,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).作者: 排出 時(shí)間: 2025-3-24 08:52 作者: 有助于 時(shí)間: 2025-3-24 14:11
https://doi.org/10.1007/b94864DNA; DNA algorithms; DNA computing; DNA self-assembly; DNA-based cryptography; Membrane Computing; P syste作者: Endearing 時(shí)間: 2025-3-24 15:16 作者: 頑固 時(shí)間: 2025-3-24 19:09 作者: Rustproof 時(shí)間: 2025-3-25 01:59
https://doi.org/10.1007/978-3-642-47937-3We 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.作者: 巧辦法 時(shí)間: 2025-3-25 05:50 作者: Dignant 時(shí)間: 2025-3-25 07:35
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.作者: 合并 時(shí)間: 2025-3-25 15:32
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.作者: 向外才掩飾 時(shí)間: 2025-3-25 18:29
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 時(shí)間: 2025-3-25 23:23 作者: 急性 時(shí)間: 2025-3-26 04:10
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/163094.jpg作者: 裁決 時(shí)間: 2025-3-26 07:43 作者: CRACY 時(shí)間: 2025-3-26 10:03
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)魚 時(shí)間: 2025-3-26 15:42
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 時(shí)間: 2025-3-26 19:47
Aspects of Molecular Computing978-3-540-24635-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Fracture 時(shí)間: 2025-3-26 22:52 作者: xanthelasma 時(shí)間: 2025-3-27 01:22 作者: fructose 時(shí)間: 2025-3-27 07:31 作者: 外貌 時(shí)間: 2025-3-27 13:03
Flexibilit?t in logistischen Systemenines. One of the key features of the balance machine is its “bidirectional” operation: both a function and its (partial) inverse can be computed spontaneously using the same machine. Some practical applications of the model are discussed.作者: ELUC 時(shí)間: 2025-3-27 13:50 作者: 蕨類 時(shí)間: 2025-3-27 19:01 作者: radiograph 時(shí)間: 2025-3-27 22:03 作者: Awning 時(shí)間: 2025-3-28 02:38 作者: 粗語 時(shí)間: 2025-3-28 09:54
https://doi.org/10.1007/978-3-531-90389-7lem for realistic strings: when do two different realistic legal strings translate into the same overlap graph? Realistic legal strings are legal strings that “really” correspond to genes generated during the gene assembly process.作者: Diastole 時(shí)間: 2025-3-28 14:19
Splicing Test Tube Systems and Their Relation to Splicing Membrane Systems,ane systems with splicing rules assigned to membranes, too. In all the systems considered in this paper, for the application of rules leading from one configuration to the succeeding configuration we use a sequential model, where only one splicing rule is applied in one step; moreover, all these systems have universal computational power.作者: 投票 時(shí)間: 2025-3-28 15:27 作者: RENIN 時(shí)間: 2025-3-28 18:47 作者: 事物的方面 時(shí)間: 2025-3-29 02:00
,Ma?nahmen zur optimalen Fl?chenausnützung,sizes and shapes is the principal objective. We shall spell out the algorithmic properties and combinatorial constraints of “physical protocols”, to bring the working hypotheses of chemists closer to a mathematical formulation.作者: CBC471 時(shí)間: 2025-3-29 03:06
Akzeptanz der Kernarbeitsnormen C87 und C98,nal formula from the celebrated recent paper, [3]. The third one shows how in the very simple case of four-letter DNA alphabets we can obtain weird (not even .-rational) patterns of population growth.作者: 去才蔑視 時(shí)間: 2025-3-29 09:50 作者: 類人猿 時(shí)間: 2025-3-29 12:27
The Power of Networks of Watson-Crick D0L Systems,nal formula from the celebrated recent paper, [3]. The third one shows how in the very simple case of four-letter DNA alphabets we can obtain weird (not even .-rational) patterns of population growth.作者: Lineage 時(shí)間: 2025-3-29 18:51
Book 2004s for the purpose of actual computations while, on the other hand, it attempts to understand the computational nature of molecular processes going on in living cells...The book presents a unique and authorative state-of-the-art survey on current research in molecular computing: 30 papers by leading 作者: 松緊帶 時(shí)間: 2025-3-29 22:46 作者: 一罵死割除 時(shí)間: 2025-3-30 00:41
Handlungsempfehlungen und Implikationen by recognizing P systems with active membranes using 2-division. Also, the linear time solution of the vertex cover problem is given using P systems with active membranes using 2-division and linear resources.作者: ECG769 時(shí)間: 2025-3-30 07:39 作者: Stagger 時(shí)間: 2025-3-30 10:56 作者: Impugn 時(shí)間: 2025-3-30 13:44
,Arbeitsmarkttheoretische Erkl?rungsans?tze,ways context-free. However, it can be shown that the .-insertion of a regular (context-free) language into a context-free (regular) language is context-free. We also consider the decomposition of regular languages under .-insertion.作者: florid 時(shí)間: 2025-3-30 18:39 作者: lattice 時(shí)間: 2025-3-30 22:25 作者: lattice 時(shí)間: 2025-3-31 04:54
Remarks on Relativisations and DNA Encodings,y given mapping . of the notion of words appearing as substrings of others. Our first results show which parts of these two formalisms are in fact equivalent. The remaining remarks suggest how to define, to the benefits of laboratory experiments, properties of DNA encodings which merge relativization from [2] and the generality of . from [3].作者: Malaise 時(shí)間: 2025-3-31 05:06
Splicing to the Limit,nsider correspond to a subset of the splicing language which we call the .. We give a number of examples, including one based on differential equations, and we propose a definition for the limit language. With this definition we prove that a language is regular if and only if it is the limit language of a reflexive and symmetric splicing system.作者: GROUP 時(shí)間: 2025-3-31 10:05 作者: chiropractor 時(shí)間: 2025-3-31 14:51 作者: 善辯 時(shí)間: 2025-3-31 21:32
Solving Graph Problems by P Systems with Restricted Elementary Active Membranes,brane algorithms to solve the vertex cover problem and the clique problem in linear time with respect to the number of vertices and edges of the graph by recognizing P systems with active membranes using 2-division. Also, the linear time solution of the vertex cover problem is given using P systems 作者: Brochure 時(shí)間: 2025-3-31 23:00 作者: 大看臺 時(shí)間: 2025-4-1 03:28
Eilenberg P Systems with Symbol-Objects,ne, is introduced. A parallel variant of EOP systems, called EOPP systems, is also defined and the power of both EOP and EOPP systems is investigated in relationship with three parameters: number of membranes, states and set of distributed rules. It is proven that the family of Parikh sets of vector
