MATLAB software and optimal complete subgraph algorithm were used to extract and reveal the microsatellite distribution features in the complete genomes of the tobacco vein clearing virus （NC-003 378.1） from the NCB...MATLAB software and optimal complete subgraph algorithm were used to extract and reveal the microsatellite distribution features in the complete genomes of the tobacco vein clearing virus （NC-003 378.1） from the NCBI database.The results showed that the repetitions number and their location of the N-base group has been extracted and displayed.The largest repetitions of N-base group in the complete genomes of the tobacco vein clearing virus was decreased as the exponential function with the increasing of N.The method used in this study could be applied to the extraction and revealing of the microsatellite distribution features in the complete genomes of other viruses,thereby provided a basis for the research of the structure and the law of function,inheritance and variation by the using of the microsatellite distribution features.展开更多
The totally coded method (TCM) reveals the same objective law, which governs the gain calculating for signal flow graph as Mason formula does. This algorithm is carried out merely in the domain of code operation. Base...The totally coded method (TCM) reveals the same objective law, which governs the gain calculating for signal flow graph as Mason formula does. This algorithm is carried out merely in the domain of code operation. Based on pure code algorithm, it is more efficient because figure searching is no longer necessary. The code-series ( CS ), which are organized from node association table, have the holoinformation nature, so that both the content and the sign of each gain-term can be determined via the coded method.The principle of this method is obvious and it is suited for computer programming. The capability of the computeraided analysis for Switched Capacitor (SCN) can be enhanced.展开更多
A k coloring(not necessarily proper) of vertices of a graph is called acyclic, if for every pair of distinct colors i and j the subgraph induced by the edges whose endpoints have colors i and j is acyclic. We consider...A k coloring(not necessarily proper) of vertices of a graph is called acyclic, if for every pair of distinct colors i and j the subgraph induced by the edges whose endpoints have colors i and j is acyclic. We consider some generalized acyclic k colorings, namely, we require that each color class induces an acyclic or bounded degree graph. Mainly we focus on graphs with maximum degree 5. We prove that any such graph has an acyclic 5 coloring such that each color class induces an acyclic graph with maximum degree at most 4. We prove that the problem of deciding whether a graph G has an acyclic 2 coloring in which each color class induces a graph with maximum degree at most 3 is NP complete, even for graphs with maximum degree 5. We also give a linear time algorithm for an acyclic t improper coloring of any graph with maximum degree d assuming that the number of colors is large enough.展开更多
基金Supported by the Eleventh Five-year Development Planning Project for Instructional Science in Hubei Province (2006B131)~~
文摘MATLAB software and optimal complete subgraph algorithm were used to extract and reveal the microsatellite distribution features in the complete genomes of the tobacco vein clearing virus （NC-003 378.1） from the NCBI database.The results showed that the repetitions number and their location of the N-base group has been extracted and displayed.The largest repetitions of N-base group in the complete genomes of the tobacco vein clearing virus was decreased as the exponential function with the increasing of N.The method used in this study could be applied to the extraction and revealing of the microsatellite distribution features in the complete genomes of other viruses,thereby provided a basis for the research of the structure and the law of function,inheritance and variation by the using of the microsatellite distribution features.
文摘The totally coded method (TCM) reveals the same objective law, which governs the gain calculating for signal flow graph as Mason formula does. This algorithm is carried out merely in the domain of code operation. Based on pure code algorithm, it is more efficient because figure searching is no longer necessary. The code-series ( CS ), which are organized from node association table, have the holoinformation nature, so that both the content and the sign of each gain-term can be determined via the coded method.The principle of this method is obvious and it is suited for computer programming. The capability of the computeraided analysis for Switched Capacitor (SCN) can be enhanced.
基金supported by the Minister of Science and Higher Education of Poland (Grant No. JP2010009070)
文摘A k coloring(not necessarily proper) of vertices of a graph is called acyclic, if for every pair of distinct colors i and j the subgraph induced by the edges whose endpoints have colors i and j is acyclic. We consider some generalized acyclic k colorings, namely, we require that each color class induces an acyclic or bounded degree graph. Mainly we focus on graphs with maximum degree 5. We prove that any such graph has an acyclic 5 coloring such that each color class induces an acyclic graph with maximum degree at most 4. We prove that the problem of deciding whether a graph G has an acyclic 2 coloring in which each color class induces a graph with maximum degree at most 3 is NP complete, even for graphs with maximum degree 5. We also give a linear time algorithm for an acyclic t improper coloring of any graph with maximum degree d assuming that the number of colors is large enough.
