Bibliografías temáticas / DNA computing experiment

Índice

Artículos de revistas

Literatura académica sobre el tema "DNA computing experiment"

Autor: Grafiati

Publicado: 11 de marzo de 2023

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "DNA computing experiment".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Artículos de revistas sobre el tema "DNA computing experiment"

Nakajima, T., Y. Sakai, and A. Suyama. "Experiment of DNA computing with robot." Seibutsu Butsuri 40, supplement (2000): S152. http://dx.doi.org/10.2142/biophys.40.s152_3.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Stoschek, E., M. Sturm, and T. Hinze. "DNA-Computing – ein funktionales Modell im laborpraktischen Experiment." Informatik Forschung und Entwicklung 16, no. 1 (2001): 35–52. http://dx.doi.org/10.1007/pl00009141.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

YAMAMOTO, MASAHITO, YUMI KAWAZOE, AZUMA OHUCHI, ATSUSHI KAMEDA, NOBUO MATSUURA, and TOSHIKAZU SHIBA. "LOCAL SEARCH BY CONCENTRATION-CONTROLLED DNA COMPUTING." International Journal of Computational Intelligence and Applications 02, no. 04 (2002): 447–55. http://dx.doi.org/10.1142/s1469026802000750.

Texto completo

Resumen

Concentration-controlled DNA computing is presented for accomplishing a local search for the solution of a shortest path problem. In this method, the concentrations of DNA representing edges are determined according to the costs on edges, and then the hybridization process is performed. Since the concentrations of hopeless candidate solutions tend to be small after the hybridization process, a local search by concentration-controlled DNA computing is a promising approach. In order to discuss about the relationship between given costs on edges in the graph and concentrations of generated DNA paths, a simulation model of the hybridization process is used and the results of a laboratory experiment are shown.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Huang, You Rui, Jing Wang, and Xiao Min Tian. "DNA Addition Algorithm Based on Molecular Beacon." Advanced Materials Research 424-425 (January 2012): 1164–69. http://dx.doi.org/10.4028/www.scientific.net/amr.424-425.1164.

Texto completo

Resumen

A new DNA computing model to realize binary integer additions based on molecular beacon is described in this paper. The binary 0 and 1 are represented by two different fluorescent states of a molecular beacon since its two different structures. By designing sequences of molecular beacons skillfully, and using the relationship between each two corresponding bits and their result and carry bit of two operational numbers, the computing process to compute each two corresponding bits of the binary numbers is simulated in the test tube. Finally, the results can be read only by detecting whether the fluorescence in tube emits. The result of the experiment shows that the algorithm is simple and convenient, and the algorithm provides a new idea for DNA computing to realize arithmetic operations

Los estilos APA, Harvard, Vancouver, ISO, etc.

Tian, Xiang, Xiyu Liu, Hongyan Zhang, Minghe Sun, and Yuzhen Zhao. "A DNA algorithm for the job shop scheduling problem based on the Adleman-Lipton model." PLOS ONE 15, no. 12 (2020): e0242083. http://dx.doi.org/10.1371/journal.pone.0242083.

Texto completo

Resumen

A DNA (DeoxyriboNucleic Acid) algorithm is proposed to solve the job shop scheduling problem. An encoding scheme for the problem is developed and DNA computing operations are proposed for the algorithm. After an initial solution is constructed, all possible solutions are generated. DNA computing operations are then used to find an optimal schedule. The DNA algorithm is proved to have an O(n2) complexity and the length of the final strand of the optimal schedule is within appropriate range. Experiment with 58 benchmark instances show that the proposed DNA algorithm outperforms other comparative heuristics.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Huang, Chun, Ying-Jie Han, Jun-Wei Sun, Wei-Jun Zhu, Yan-Feng Wang, and Qing-Lei Zhou. "The Design and Application of Exclusive OR Logical Computation Based on DNA 3-Arm Sub-Tile Self-Assembly." Journal of Nanoelectronics and Optoelectronics 15, no. 11 (2020): 1327–34. http://dx.doi.org/10.1166/jno.2020.2853.

Texto completo

Resumen

DNA algorithmic self-assembly plays a vital role in DNA computing, which is applied to create new DNA tiles and then guides these tiles into an algorithmic lattice. However, the larger the logical calculation scale is, the more tile sets will be needed, so that computing model design and experiment will be increasingly difficult. This paper presents a new DNA ‘3-arm sub-tile strategy’ that constructs XOR and half-adder logical circuits. The types of DNA tile corresponding to the logical values is unified in DNA XOR and half-adder logical circuits, which have only three kinds of DNA tiles: logic ‘0’, logic ‘1’ and fixation tile. Compared with the previous references, the amount of DNA tile types has been greatly reduced. Moreover, the half-adder molecular circuit has a distinctive feature, which is an application of the expansion of the XOR logic circuit. Meanwhile, a set of DNA 3-arm sub-tiles suitable for half-adder logical computation is designed on the NUPACK online server. The simulated experiments show that the correct rate of base pairing of the designed DNA encoding is high and the structures are stable. The DNA 3-arm sub-tile self-assembly methods provide a new way to form DNA logical circuits, and has a great potential in the expansion of the integrated circuits.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Ma, Jingjing. "Molecular Logic Gate Based on DNA Strand Displacement Reaction." Journal of Nanoelectronics and Optoelectronics 16, no. 6 (2021): 974–77. http://dx.doi.org/10.1166/jno.2021.3037.

Texto completo

Resumen

In this paper, I construct an XOR logic gate based on DNA strand displacement reaction, and verify our design through corresponding biochemical experiment. I designed several different DNA strands. Based on two basic DNA strand displacement reaction mechanisms, by adding different input strands and taking the signal of FAM fluorescent group as the output, the XOR logic gate is realized. The result shows that DNA strand displacement technology has important application value in DNA computing, especially in the construction of DNA molecular logic gates.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Zhou, Shihua, Bin Wang, Xuedong Zheng, and Changjun Zhou. "An Image Encryption Scheme Based on DNA Computing and Cellular Automata." Discrete Dynamics in Nature and Society 2016 (2016): 1–9. http://dx.doi.org/10.1155/2016/5408529.

Texto completo

Resumen

Networks have developed very quickly, allowing the speedy transfer of image information through Internet. However, the openness of these networks poses a serious threat to the security of image information. The field of image encryption has drawn attention for this reason. In this paper, the concepts of 1-dimensional DNA cellular automata and T-DNA cellular automata are defined, and the concept of reversible T-DNA cellular automata is introduced. An efficient approach to encryption involving reversible T-DNA cellular automata as an encryption tool and natural DNA sequences as the main keys is here proposed. The results of a simulation experiment, performance analysis, and comparison to other encryption algorithms showed this algorithm to be capable of resisting brute force attacks, statistical attacks, and differential attacks. It also enlarged the key space enormously. It meets the criteria for one-time pad and resolves the problem that one-time pad is difficult to save.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Zhang, Xinxin, Nan Zhao, and Jing Yang. "Operation of Queue and Stack by DNA Tiles." E3S Web of Conferences 218 (2020): 03051. http://dx.doi.org/10.1051/e3sconf/202021803051.

Texto completo

Resumen

DNA is used as self-nanomaterials to assemble into specific structures. DNA tile provides a new idea for the application of DNA tile in the field of computing. Recent years, Queue and Stack are important linear data structures which are used in various software systems widely. The implementation of DNA based queue and stack has been studied continuously for many years. In the traditional DNA computing, queue and stack are mostly realized by DNA strands displacement, restriction endonuclease and ligase were used. However, as an active material, it has a high requirement for enzyme experimental conditions. The purpose of this paper is to implement queue and stack structures using non-enzyme systems. The rule of Queue is characterized by FIFO (first in first out), which allows for insertion at one end of the list and deletion at the other. The rule of Stack is characterized by FILO(first in last out), which allows for insertion and deletion at one end of the list. We are aimed to implement Queue and Stack using self-assembly and disassembly via DNA Tiles. No enzymes are needed for the whole experiment. As an enzyme-free system, it provides a new method to implement stack and queue.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Shan, Jing Yi, Zhi Xiang Yin, Xin Yu Tang, and Jing Jing Tang. "A DNA Computing Model for the AND Gate in Three-Valued Logical Circuit." Applied Mechanics and Materials 610 (August 2014): 764–68. http://dx.doi.org/10.4028/www.scientific.net/amm.610.764.

Texto completo

Resumen

Multiple-valued logic is an extended form of Boolean logic. In daily life, people often encounter the problem about the multiple-valued logic. With further study on Boolean logic, multiple-valued logic has been paid more and more attention by researchers. This paper achieves the operation of AND gate in three-valued logic by using the DNA hairpin structure. The experiment makes the DNA hairpin structure as the basic structure, and the molecular beacon as the input signal, and at last judges the logical results according to the intensity of fluorescence and gel electrophoresis. This method has the advantages that it has high sensitivity, good feasibility, and it is easy to observe. In addition, this method reduces the hybrid competition to a certain extent, and it is a new attempt to the research on multiple-valued logic.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Más fuentes

Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!