標題: Titlebook: DNA Computing; 10th International W Claudio Ferretti,Giancarlo Mauri,Claudio Zandron Conference proceedings 2005 Springer-Verlag Berlin Hei [打印本頁] 作者: affected 時間: 2025-3-21 18:38
書目名稱DNA Computing影響因子(影響力)
書目名稱DNA Computing影響因子(影響力)學科排名
書目名稱DNA Computing網(wǎng)絡公開度
書目名稱DNA Computing網(wǎng)絡公開度學科排名
書目名稱DNA Computing被引頻次
書目名稱DNA Computing被引頻次學科排名
書目名稱DNA Computing年度引用
書目名稱DNA Computing年度引用學科排名
書目名稱DNA Computing讀者反饋
書目名稱DNA Computing讀者反饋學科排名
作者: 哪有黃油 時間: 2025-3-21 20:27 作者: Exclude 時間: 2025-3-22 01:47 作者: Collected 時間: 2025-3-22 07:13
Theorie und Praxis der Diskursforschungsystem under fairly general assumptions: tiles can both attach and fall off depending on the thermodynamic rate parameters which also govern the error rate. We prove that with appropriate values of the block size, a seed row of . tiles can be extended into an . × . square of tiles . in expected time作者: Subdue 時間: 2025-3-22 10:20 作者: 吞吞吐吐 時間: 2025-3-22 14:55 作者: 吞吞吐吐 時間: 2025-3-22 19:38 作者: Contracture 時間: 2025-3-23 01:10 作者: Yourself 時間: 2025-3-23 05:09
,Der Prozess des Probleml?sens,dering sticker systems in the standard manner. Even regular simple sticker systems (whose generative power is subregular) become universal when considered in this new framework. The significance of these results for DNA computing (by sticker systems) is briefly discussed.作者: apropos 時間: 2025-3-23 05:45 作者: CROAK 時間: 2025-3-23 11:58
Hans-Dieter Lippert,Bernd-Rüdiger Kerne 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 .-.-code property introduced by Jonoska and Mahalingam.作者: ethnology 時間: 2025-3-23 14:34
https://doi.org/10.1007/978-3-642-78388-3ows 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.作者: Lasting 時間: 2025-3-23 18:22 作者: 果核 時間: 2025-3-23 23:29
Computing by Observing Bio-systems: The Case of Sticker Systems,dering sticker systems in the standard manner. Even regular simple sticker systems (whose generative power is subregular) become universal when considered in this new framework. The significance of these results for DNA computing (by sticker systems) is briefly discussed.作者: Respond 時間: 2025-3-24 02:59
Parallelism in Gene Assembly,rallel a micronuclear gene. We believe that the study of parallelism contributes to a better understanding of the nature of gene assembly, and in particular it provides a new insight in the complexity of this process.作者: 分散 時間: 2025-3-24 08:43
Bond-Free Languages: Formalizations, Maximality and Construction Methods,e 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 .-.-code property introduced by Jonoska and Mahalingam.作者: 金盤是高原 時間: 2025-3-24 14:15
Preventing Undesirable Bonds Between DNA Codewords,ows 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.作者: Commentary 時間: 2025-3-24 15:48
Minimum Basin Algorithm: An Effective Analysis Technique for DNA Energy Landscapes,tra’s and Jarník-Prim’s algorithms, we generate the shape of the basin from its formation process. The resulting basin contains the true energy barrier. Furthermore, a comparison between the basin feature and the corresponding actual chemical reaction shows that the basin can be used as a criterion to explain the reaction.作者: 放逐某人 時間: 2025-3-24 19:22
Ausblick und künftige Problemfelderparticular, given a function, we study the time required to determine its value for a given input. In the simplest instance, the analysis has interesting connections with interacting particle systems and variational problems.作者: 你不公正 時間: 2025-3-25 02:42 作者: INCUR 時間: 2025-3-25 03:53
Computing Beyond the Turing Limit Using the H Systems,t if the function recording the behavior of the external factor is uncomputable so is the newly defined model, thus exceeding the Turing barrier. We also construct an universal system that is also more powerful than the Turing Machines.作者: aplomb 時間: 2025-3-25 08:22
Using Automated Reasoning Systems on Molecular Computing,have proven in the PVS proof checker, the correctness of a program, in a sticker based model for DNA computation, solving the pairwise disjoint families problem. Also we introduce the formalization of the Floyd–Hoare logic for imperative programs.作者: invade 時間: 2025-3-25 14:29 作者: 愛得痛了 時間: 2025-3-25 17:30 作者: esoteric 時間: 2025-3-25 23:32 作者: 整理 時間: 2025-3-26 02:33
Andrea Kettenbach,Ingrid Josephstions of Turing machine?.. Next, coding the states of . and the non-terminal symbols of ., we obtain an extended H system . which generates . using |.| + 2 symbols. At last, by encoding the alphabet, we obtain a splicing system . which generates a universal recursively enumerable set using only two letters.作者: 琺瑯 時間: 2025-3-26 07:57 作者: 戲法 時間: 2025-3-26 09:27
Hans-Dieter Lippert,Bernd-Rüdiger Kernperimental results show that parallel overlap assembly is a better choice in terms of generation speed and material consumption than the hybridization/ligation method. Simulation of parallel overlap assembly was performed to investigate the potential and the limitation of the method.作者: 運動性 時間: 2025-3-26 16:15 作者: 大門在匯總 時間: 2025-3-26 17:19
Characterization of Non-crosshybridizing DNA Oligonucleotides Manufactured , ,ressure. Melting curves of protocol product also indicated non-crosshybridization when compared to control samples. Thus, it appears that the protocol does select populations of non-crosshybridizing sequences.作者: 生命層 時間: 2025-3-27 00:52
,On the Computational Complexity of ,?Automata,hen the accepted language class is strictly included in the class of languages accepted by one-way Turing machines with a logarithmically bounded workspace, and if the rules are applied in the maximal parallel manner, then the class of context-sensitive languages is obtained.作者: 尾巴 時間: 2025-3-27 04:17
Splicing Systems for Universal Turing Machines,tions of Turing machine?.. Next, coding the states of . and the non-terminal symbols of ., we obtain an extended H system . which generates . using |.| + 2 symbols. At last, by encoding the alphabet, we obtain a splicing system . which generates a universal recursively enumerable set using only two letters.作者: Capitulate 時間: 2025-3-27 06:00 作者: 阻塞 時間: 2025-3-27 10:34
Efficient Initial Pool Generation for Weighted Graph Problems Using Parallel Overlap Assembly,perimental results show that parallel overlap assembly is a better choice in terms of generation speed and material consumption than the hybridization/ligation method. Simulation of parallel overlap assembly was performed to investigate the potential and the limitation of the method.作者: STALL 時間: 2025-3-27 15:01
DNA Computing978-3-540-31844-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: white-matter 時間: 2025-3-27 18:13
0302-9743 Overview: 978-3-540-26174-2978-3-540-31844-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 不真 時間: 2025-3-27 23:46
Die zeitliche Dimension der Inanspruchnahmer, a special type of PCR is presented with a related algorithm which performs a specified extraction from a given pool of DNA double stranded (shortly dsDNA) molecules. This kind of PCR, called Cross Pairing PCR (shortly XPCR) was tested in several situations, and used in a biotechnological procedure which implements the extraction algorithm.作者: 聾子 時間: 2025-3-28 03:09 作者: hemorrhage 時間: 2025-3-28 09:24 作者: 終端 時間: 2025-3-28 10:46 作者: 天空 時間: 2025-3-28 18:19
,Der Prozess des Probleml?sens,ut. Inspired by this, a new approach to computing, called system/observer, was introduced in?[3]..In this paper we apply this strategy to sticker systems, [8,11]. In particular we use finite automata (playing the role of observer) watching the “evolution” of a sticker system and translating such “ev作者: palliate 時間: 2025-3-28 22:40 作者: 辮子帶來幫助 時間: 2025-3-29 00:57
Ausblick und künftige Problemfelderplicing rules. We improve the best known universality result for time-varying H systems with respect to the diameter of such a system and we prove that if the function recording the behavior of the external factor is uncomputable so is the newly defined model, thus exceeding the Turing barrier. We a作者: anaphylaxis 時間: 2025-3-29 03:11
https://doi.org/10.1007/978-3-658-06411-2ounded stack memory, push-down automata, using circular DNA molecules and a class IIs restriction enzyme. The proposed ideas are inspired by the results from [1]. The same ideas are extended to show a way to implement push-down automata with two stacks (i.e, universal computing devices) using two ci作者: 不確定 時間: 2025-3-29 09:57
Theorie und Praxis der Diskursforschungquencing after several iterations of the protocol showed that the sequences, in general, became more non-crosshybridizing. Gel electrophoresis of protocol product, also, indicated non-crosshybridization, and showed evolution in the population of molecules under the non-crosshybridization selection p作者: CON 時間: 2025-3-29 13:22
Theorie und Praxis der Diskursforschungs often equipped with explicit mechanisms for both error prevention and error correction. For artificial self-assembly, these problems are even more important since we are interested in assembling large systems with great precision..We present an error-correction scheme, called snaked proof-reading,作者: Chameleon 時間: 2025-3-29 16:36
Arbeiterklasse und Volksgemeinschaftnatural computing systems, we study computational complexity classes with a certain restriction on the use of the available workspace in the course of computations and relate these to the language classes described by .?automata. We prove that if the rules of the . system are applied sequentially, t作者: JIBE 時間: 2025-3-29 23:42
Die zeitliche Dimension der Inanspruchnahmelocks in biomolecular computing and other biotechnical applications that employ DNA hybridization assays. We introduce new metrics for DNA code design that capture key aspects of the nearest neighbor thermodynamic model for hybridized DNA duplexes. One version of our metric gives the maximum number 作者: 報復 時間: 2025-3-30 00:09
Die zeitliche Dimension der Inanspruchnahmer, a special type of PCR is presented with a related algorithm which performs a specified extraction from a given pool of DNA double stranded (shortly dsDNA) molecules. This kind of PCR, called Cross Pairing PCR (shortly XPCR) was tested in several situations, and used in a biotechnological procedur作者: BIAS 時間: 2025-3-30 06:29
https://doi.org/10.1007/978-3-658-07918-5e speci.c hybridization between complementary strands. Hence hybridization is not a deterministic, but stochastic, process which depends on tile concentration and temperature. For that reason, it is di.cult to obtain an aggregate with no error. Growth speed of the aggregate must be very low to obtai作者: painkillers 時間: 2025-3-30 12:18 作者: macular-edema 時間: 2025-3-30 15:19 作者: Moderate 時間: 2025-3-30 20:18 作者: 補充 時間: 2025-3-31 00:30 作者: 名字的誤用 時間: 2025-3-31 03:27
Hans-Dieter Lippert,Bernd-Rüdiger Kerned bonds when used in DNA computations. We recall a few existing formalizations of the problem and then define 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 regu作者: sorbitol 時間: 2025-3-31 06:22 作者: 教育學 時間: 2025-3-31 11:13
Hans-Dieter Lippert,Bernd-Rüdiger Kerny . ∈ ., the minimum free energy of . is greater than or equal to 0. It was open whether or not there exists a polynomial time algorithm for testing the structure freeness of a given regular set .. In this paper, we will solve this problem.作者: 坦白 時間: 2025-3-31 14:18 作者: IDEAS 時間: 2025-3-31 18:53
Hans-Dieter Lippert,Bernd-Rüdiger Kernation have been proposed, including hybridization/ligation and mix/split methods. Here, we implement and compare parallel overlap assembly with the hybridization/ligation method. We applied these methods to the molecular algorithm to solve an instance of the graph problem with weighted edges. Our ex作者: 意外 時間: 2025-3-31 22:38
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/260111.jpg作者: recede 時間: 2025-4-1 05:01
https://doi.org/10.1007/b136914DNA computing; Membrane Computing; algorithms; automata; automated reasoning; biocomputing; biomolecular c作者: 豐滿有漂亮 時間: 2025-4-1 09:06
978-3-540-26174-2Springer-Verlag Berlin Heidelberg 2005作者: Generalize 時間: 2025-4-1 10:11
Computing by Observing Bio-systems: The Case of Sticker Systems,ut. Inspired by this, a new approach to computing, called system/observer, was introduced in?[3]..In this paper we apply this strategy to sticker systems, [8,11]. In particular we use finite automata (playing the role of observer) watching the “evolution” of a sticker system and translating such “ev作者: 驕傲 時間: 2025-4-1 18:19
DNA-Based Computation Times,erformance of such devices approaches physical limits, new computing paradigms are emerging. Two paradigms receiving great attention are quantum and DNA-based molecular computing..This paper focuses on DNA-based computing. This paradigm can be abstracted to growth models where computational elements作者: 得罪人 時間: 2025-4-1 20:32 作者: 顛簸下上 時間: 2025-4-2 01:15
Biomolecular Implementation of Computing Devices with Unbounded Memory,ounded stack memory, push-down automata, using circular DNA molecules and a class IIs restriction enzyme. The proposed ideas are inspired by the results from [1]. The same ideas are extended to show a way to implement push-down automata with two stacks (i.e, universal computing devices) using two ci作者: Outmoded 時間: 2025-4-2 03:34
Characterization of Non-crosshybridizing DNA Oligonucleotides Manufactured , ,quencing after several iterations of the protocol showed that the sequences, in general, became more non-crosshybridizing. Gel electrophoresis of protocol product, also, indicated non-crosshybridization, and showed evolution in the population of molecules under the non-crosshybridization selection p作者: EXTOL 時間: 2025-4-2 09:35
Error Free Self-assembly Using Error Prone Tiles,s often equipped with explicit mechanisms for both error prevention and error correction. For artificial self-assembly, these problems are even more important since we are interested in assembling large systems with great precision..We present an error-correction scheme, called snaked proof-reading,
