標題: Titlebook: DNA Computing; 11th International W Alessandra Carbone,Niles A. Pierce Conference proceedings 2006 Springer-Verlag Berlin Heidelberg 2006 D [打印本頁] 作者: odometer 時間: 2025-3-21 18:17
書目名稱DNA Computing影響因子(影響力)
書目名稱DNA Computing影響因子(影響力)學科排名
書目名稱DNA Computing網絡公開度
書目名稱DNA Computing網絡公開度學科排名
書目名稱DNA Computing被引頻次
書目名稱DNA Computing被引頻次學科排名
書目名稱DNA Computing年度引用
書目名稱DNA Computing年度引用學科排名
書目名稱DNA Computing讀者反饋
書目名稱DNA Computing讀者反饋學科排名
作者: 不如屎殼郎 時間: 2025-3-21 22:57 作者: 膝蓋 時間: 2025-3-22 02:57 作者: Abbreviate 時間: 2025-3-22 07:56
Towards Practical Biomolecular Computers Using Microfluidic Deoxyribozyme Logic Gate Networks,build upon our previous work, which simulated the operation of a flip-flop and an oscillator based on deoxyribozymes in a continuous stirred-tank reactor (CSTR). Unfortunately, using these logic gates in a laboratory-size CSTR is prohibitively expensive, because the reagent quantities needed are too作者: 漂亮才會豪華 時間: 2025-3-22 12:46 作者: PANG 時間: 2025-3-22 15:33 作者: PANG 時間: 2025-3-22 19:24
Simple Operations for Gene Assembly,recombination: the molecule is folded so that two occurrences of a pointer (short nucleotide sequence) get aligned and then the sequence is rearranged through recombination of pointers. In general, the sequence rearranged by one operation can be arbitrarily long and consist of many coding and non-co作者: 分貝 時間: 2025-3-23 00:13
Counting Time in Computing with Cells, place in a cell. In the first part of the paper, we introduce and study the properties of “timed symport/antiport systems”. In the second part we introduce several new features for P systems: the association/deassociation of molecules (modeling for example the protein-protein interactions), ion cha作者: murmur 時間: 2025-3-23 02:18
On Bounded Symport/Antiport P Systems,/A system if and only if it is accepted by a .?. space-bounded Turing machine. This holds for both deterministic and nondeterministic versions..2. For every positive integer ., there is an . > . and a unary language . that is accepted by a bounded S/A system with . objects that cannot be accepted by作者: olfction 時間: 2025-3-23 07:50 作者: ZEST 時間: 2025-3-23 12:21 作者: Demulcent 時間: 2025-3-23 16:22
Efficient Algorithm for Testing Structure Freeness of Finite Set of Biomolecular Sequences,hich can be applied to the sequence design of various DNA computing experiments. We will first give a general algorithm for this problem which runs in .(. .) time. Then, we will give an evaluation method for sequence design system, which requires .(. .) time for precomputation, and .(. .) time and .作者: Irascible 時間: 2025-3-23 21:45
Communicating Distributed H Systems: Optimal Results with Efficient Ways of Communication,on of obtaining efficient distributed systems. To this end, a universality result using 2 components is obtained using two-level distributed H systems. This is an improvement over the existing universality result with 3 components. Further, we propose . communicating distributed H systems (LCDH syst作者: Mucosa 時間: 2025-3-23 23:48 作者: 無法破譯 時間: 2025-3-24 05:40
Development of an , Computer Based on , , by employing the protein-synthesis mechanism of .. Our fundamental idea to develop a programmable and autonomous finite-state automata on . is that we first encode an input string into one plasmid, encode state-transition functions into the other plasmid, and introduce those two plasmids into an . 作者: fatty-streak 時間: 2025-3-24 07:56 作者: anniversary 時間: 2025-3-24 11:20 作者: 單調性 時間: 2025-3-24 17:32 作者: Fatten 時間: 2025-3-24 19:08 作者: flourish 時間: 2025-3-25 02:33
Real- und Nominalgüterkreislaufation, PCR, and streptavidin-biotin bonding to execute . finite automata based on the length-encoding technique. We have carried laboratory experiments on various finite automata of from 2 states to 6 states for several input strings. To our knowledge, this is the first . experiments that have succeeded to execute 6-states automaton in test tube.作者: labile 時間: 2025-3-25 06:55 作者: 大量殺死 時間: 2025-3-25 10:38
Simple Operations for Gene Assembly,ncy graphs. Interestingly, we show that simple assemblies possess rather involved properties: a gene pattern may have both successful and unsuccessful assemblies and also more than one successful assembling strategy.作者: amnesia 時間: 2025-3-25 15:32 作者: 百科全書 時間: 2025-3-25 19:37
Development of an , Computer Based on , ,ble . computer by simply replacing a plasmid encoding a state-transition function with others. Further, our . finite automata are autonomous because the protein-synthesis process is autonomously executed in the living . cell. We show some successful experiments to run an . finite-state automaton on ..作者: deceive 時間: 2025-3-25 21:45 作者: 土產 時間: 2025-3-26 02:12 作者: ABASH 時間: 2025-3-26 05:33
19 Einfache Differenzialgleichungen,ed recombination is quite limited. We then extend template-guided recombination systems with the addition of “deletion contexts” and show that such systems have strictly greater computational power than splicing systems [1, 2].作者: 織布機 時間: 2025-3-26 11:11 作者: BROW 時間: 2025-3-26 13:14 作者: 陰郁 時間: 2025-3-26 18:40
Recognizing DNA Splicing, expected pattern. We prove that using finite splicing system (finite set of rules and finite set of axioms), universal computation is attainable with simple observing and accepting devices made of finite state automata.作者: 責難 時間: 2025-3-26 21:44 作者: Catheter 時間: 2025-3-27 05:11 作者: buoyant 時間: 2025-3-27 06:07 作者: carotenoids 時間: 2025-3-27 10:06
Expectation and Variance of Self-assembled Graph Structures, in some static conditions be used to predict the outcome of a graph self-assembly. Using probabilistic methods, we show the expectation and the variance of the number of self-assembled cycles, . ., and discuss generalization of these results for . .. We tie this analysis to previously observed experimental results.作者: Bumptious 時間: 2025-3-27 14:35
Hairpin Structures in DNA Words,es, as well as hairpin-free ones. We study their algebraic properties and their computational complexity. Related polynomial-time algorithms deciding hairpin-freedom of regular sets are presented. Finally, effective methods for design of long hairpin-free DNA words are given.作者: Stable-Angina 時間: 2025-3-27 18:30
Efficient Algorithm for Testing Structure Freeness of Finite Set of Biomolecular Sequences, .(. .) time. Then, we will give an evaluation method for sequence design system, which requires .(. .) time for precomputation, and .(. .) time and .(. .) space for each evaluation of sequence sets. The authors believe that this result will give an important progress of efficient sequence design systems.作者: CON 時間: 2025-3-28 00:30 作者: 不知疲倦 時間: 2025-3-28 05:40
Linearizer and Doubler : Two Mappings to Unify Molecular Computing Models Based on DNA Complementarguages and of Watson-Crick languages, which leads to not only a unified view of the two families of languages but also a clarified view of the computational capability of the DNA complementarity. One of the results implies that any recursively enumerable language can be expressed as the projective image of . .(.) for a minimal linear language ..作者: nominal 時間: 2025-3-28 08:11
Fourierreihe, Fourier-Transformationration algorithm we propose was tested by a lab experiment here described, since the presence of few sequences is enough for checking the completeness of the library. The simple technology of this approach is interesting in and of itself, and it can have many useful applications in biological contexts.作者: 名次后綴 時間: 2025-3-28 11:08 作者: 拔出 時間: 2025-3-28 14:59 作者: 冒失 時間: 2025-3-28 20:25
Communicating Distributed H Systems: Optimal Results with Efficient Ways of Communication,ems), a variant of communicating distributed H systems, with lesser communication. A universality result is obtained with this variant, using only 2 components. This improves the universality result . = . . by reducing the number of components as well as the communication between components.作者: capsaicin 時間: 2025-3-29 01:34
https://doi.org/10.1007/978-3-642-79859-7roduce several new features for P systems: the association/deassociation of molecules (modeling for example the protein-protein interactions), ion channel rules and gene activation rules. We show that such timed systems are universal. We also prove several properties concerning these systems.作者: 煩人 時間: 2025-3-29 04:26
Arbeitsbuch zur Elektrotechnik 1 in some static conditions be used to predict the outcome of a graph self-assembly. Using probabilistic methods, we show the expectation and the variance of the number of self-assembled cycles, . ., and discuss generalization of these results for . .. We tie this analysis to previously observed experimental results.作者: Silent-Ischemia 時間: 2025-3-29 10:56 作者: RECUR 時間: 2025-3-29 15:23 作者: Tidious 時間: 2025-3-29 19:36 作者: 巨頭 時間: 2025-3-29 22:16 作者: 后退 時間: 2025-3-29 23:58 作者: Ceremony 時間: 2025-3-30 05:16 作者: laparoscopy 時間: 2025-3-30 09:47 作者: inconceivable 時間: 2025-3-30 14:57 作者: 機械 時間: 2025-3-30 16:36 作者: acrimony 時間: 2025-3-30 22:48 作者: Engaging 時間: 2025-3-31 03:07
DNA Computing978-3-540-34165-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Anticoagulant 時間: 2025-3-31 07:59
0302-9743 Overview: 978-3-540-34161-1978-3-540-34165-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Infantry 時間: 2025-3-31 12:17 作者: 凈禮 時間: 2025-3-31 15:37
https://doi.org/10.1007/11753681DNA algorithms; DNA coding; DNA computers; DNA computing; Erfüllbarkeitsproblem der Aussagenlogik; algori作者: 勛章 時間: 2025-3-31 19:24 作者: 心神不寧 時間: 2025-3-31 23:14 作者: spinal-stenosis 時間: 2025-4-1 05:33
Ekkehard Christiani,Günther Dickserved behavior of a splicing system. The main idea is to input a marked DNA strand into a test tube together with certain restriction enzymes and, possibly, with other DNA strands. Under the action of the enzymes, the marked DNA strand starts to evolve by splicing with other DNA strands. The evolut作者: Eructation 時間: 2025-4-1 09:11
19 Einfache Differenzialgleichungen,mbling. It has been suggested that it would perhaps be possible to co-opt this genetic process and use it to perform arbitrary computations .. Motivated by this idea, we study here some basic properties and the computational power of a formalization inspired by the template-guided recombination mode作者: 盡忠 時間: 2025-4-1 14:05
https://doi.org/10.1007/978-3-642-79860-3build upon our previous work, which simulated the operation of a flip-flop and an oscillator based on deoxyribozymes in a continuous stirred-tank reactor (CSTR). Unfortunately, using these logic gates in a laboratory-size CSTR is prohibitively expensive, because the reagent quantities needed are too作者: 爆炸 時間: 2025-4-1 15:57
Fourierreihe, Fourier-Transformationed for generating a initial pool, it is a quaternary recombination of strings via application of null context splicing rules. Its implementation, based on a kind of PCR called XPCR, results to be convenient with respect to the standard methods, in terms of efficiency, speed and feasibility. The gene
