Graph coloring computing method based on annular DNA and its DNA computing system

A computing method and computing system technology, applied in biochemical equipment and methods, genetic models, microbial measurement/inspection, etc., can solve problems such as solution space exponent explosion, achieve the effect of improving solution efficiency and avoiding intermolecular recombination

Inactive Publication Date: 2009-07-22
PEKING UNIV
View PDF0 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] The object of the present invention is to provide a graph coloring calculation method and system based on circular DNA, so as to obtain a graph vertex coloring scheme containing any n

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Graph coloring computing method based on annular DNA and its DNA computing system
  • Graph coloring computing method based on annular DNA and its DNA computing system
  • Graph coloring computing method based on annular DNA and its DNA computing system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0045] The following examples are used to illustrate the present invention, but are not intended to limit the scope of the present invention.

[0046] figure 1 It is a flowchart of an embodiment of a graph coloring calculation method based on circular DNA of the present invention. As shown in the figure, the method of this embodiment includes the following three steps:

[0047] S101. Obtain a set of vertex coloring schemes corresponding to the graph according to a given color type;

[0048] S102. According to the set of vertex coloring schemes, among the edges whose vertex number sequences are not adjacent but connected, find out the edge whose color is not determined for the two vertices;

[0049] S103 , using circular DNA molecular calculations, using a backtracking method to delete non-solutions for the found edges whose colors are not determined for the two vertices, and obtain a set of true solutions of the vertex coloring scheme.

[0050] In the entire solution process...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to a graph coloring node operation method based on the ring-shaped DNA, comprising the following steps of obtaining the coloring scheme congregation of a vertex corresponding to a graph according to given color kinds; finding out two edges with undetermined vertex colors from edges with nonadjacent but connected vertex digit sequences according to the coloring scheme congregation of the vertex; and deleting and untying the two edges with undetermined vertex colors by the operation of the ring-shaped DNA and a backtracking method to obtain the true solution set of vertex coloring schemes. The technical proposal of the invention is to explain graphs, avoids the molecule recombination by concurrency of the life-form operation of the DNA operation and based on the characteristic of the operation of the ring-shaped DNA, and gradually obtains the vertex coloring scheme congregation for a coloring graph, thereby organically combining an optimized operation method, DNA sequence codes, various biochemistry operations, solution detection problems, solution space scales and the like, and enhancing the solving rate of the coloring problem of a graph.

Description

technical field [0001] The invention relates to biological nanocomputing technology, in particular to a circular DNA-based graph coloring computing method and a DNA computing system thereof. Background technique [0002] In 1994, Adleman first used DNA molecules as "data" and biological enzymes and biological operations as information processing "tools" to establish a DNA computing model. This property of base complementarity makes DNA an important material: interactions between short strands can be engineered through sequence design. The characteristics of the double helix structure make it possible to generate complex three-dimensional structures. With this precise structural control, DNA molecules can self-assemble into functional multimolecular structures: networks of molecular circuits, optical devices, and enzymes. [0003] In recent years, much work has been done in the field of DNA computing and nanomachines. The so-called DNA computing refers to the information p...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06N3/12C12Q1/68C12P19/34
Inventor 张成杨静许进刘向荣王淑栋强小利
Owner PEKING UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap