A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation.
Zhaocai WangDongmei HuangHuajun MengChengpei TangPublished in: Biosyst. (2013)
Keyphrases
- computational complexity
- np hard
- high accuracy
- recognition algorithm
- learning algorithm
- expectation maximization
- dynamic programming
- experimental evaluation
- theoretical analysis
- matching algorithm
- computational cost
- improved algorithm
- optimal solution
- worst case
- linear programming
- objective function
- optimization algorithm
- detection algorithm
- parallel implementation
- times faster
- convex hull
- computationally efficient
- probabilistic model
- cost function
- evolutionary algorithm
- search space
- decision trees