A Simple Algorithm for Solving the All-Pairs Minimum Value Cut Problem Using DNA Computing.
Marzieh KhodaeeVahid HashemiMohammad AminisharifabadPublished in: BICoB (2011)
Keyphrases
- similarity measure
- implicit enumeration
- cost function
- preprocessing
- computational complexity
- dna computing
- matching algorithm
- optimization algorithm
- dynamic programming
- np hard
- objective function
- detection algorithm
- search space
- maximum flow
- minimum cut
- learning algorithm
- particle swarm optimization
- k means
- combinatorial optimization
- linear programming
- expectation maximization
- linear program
- dna sequences
- spanning tree
- optimal solution