DNA computing has natural advantage to solve complex NP problem. In this paper, a DNA parallel algorithm is introduced to solve the least maximal matching problem using DNA molecular operations in O(n(2)) time complex...
详细信息
DNA computing has natural advantage to solve complex NP problem. In this paper, a DNA parallel algorithm is introduced to solve the least maximal matching problem using DNA molecular operations in O(n(2)) time complexity. We reduce the complexity of the computation and theoretically prove the correctness of the algorithm.
The maximum weighted clique (MWC) problem, as a typical NP-complete problem, is difficult to be solved by the electronic computer algorithm. The aim of the problem is to seek a vertex clique with maximal weight sum in...
详细信息
The maximum weighted clique (MWC) problem, as a typical NP-complete problem, is difficult to be solved by the electronic computer algorithm. The aim of the problem is to seek a vertex clique with maximal weight sum in a given undirected graph. It is an extremely important problem in the field of optimal engineering scheme and control with numerous practical applications. From the point of view of practice, we give a parallel biological algorithm to solve the MWC problem. For the maximum weighted clique problem with.. edges and.. vertices, we use fixed length DNA strands to represent different vertices and edges, fully conduct biochemical reaction, and find the solution to the MVC problem in certain length range with O(n(2)) time complexity, comparing to the exponential time level by previous computer algorithms. We expand the applied scope of parallel biological computation and reduce computational complexity of practical engineering problems. Meanwhile, we provide a meaningful reference for solving other complex problems.
The cubic subgraph is a famous problem in the subject range of computational mathematics and computer science, having an important applications in real life. In this paper, a biological DNA computing algorithm is intr...
详细信息
The k-vertex weighted clique problem aims to find a vertex clique set with k vertices and maximum weight sum in a given undirected graph. Based on biological molecular computation, the paper describes a new DNA proced...
详细信息
The assignment problem (AP) is to optimally solve the task of assigning n jobs to n individuals, such that minimum cost or maximum profit can be obtained. It is a vitally important NP-complete problem in operation man...
详细信息
The assignment problem (AP) is to optimally solve the task of assigning n jobs to n individuals, such that minimum cost or maximum profit can be obtained. It is a vitally important NP-complete problem in operation management and applied mathematics, having a wide range of applications. In this paper, we present a new parallel DNA algorithm to solve the assignment problem using DNA molecular operations. Meanwhile, we design flexible length DNA strands to represent different jobs and individuals, take appropriate steps and get the solutions of the AP in proper length range and with O(n(2)) time complexity. We extend the application of DNA molecular operations and simultaneity reduce the complexity of the computation. (C) 2014 Elsevier Inc. All rights reserved.
There are many studies on the flow movement in compound channels, yet few are concerned with sediment transport. An experimental study on the flow movement and sediment transport in compound channels is presented. The...
详细信息
There are many studies on the flow movement in compound channels, yet few are concerned with sediment transport. An experimental study on the flow movement and sediment transport in compound channels is presented. The experimental results indicate that the distribution of longitudinal velocity with depth in the main channel and the floodplains has a logarithmic component. The longitudinal velocity with flow depth in the interactive region does not obey a logarithmic distribution, but involves a wake function. In the boundary region, the longitudinal velocity obeys a parabolic distribution. In addition, based on the suspended sediment diffusion equation and the flow interaction between main channel and floodplains, expressions are derived to predict the lateral eddy viscosity and the sediment diffusion coefficients. Finally, an analytical solution for the lateral distribution of the depth-averaged velocity and sediment concentration in a compound channel is obtained. The results from the analytical solution agree well with experimentation.
暂无评论