A polynomial time algorithm for computing the area under a GDT curve.
Aleksandar PoleksicPublished in: Algorithms Mol. Biol. (2015)
Keyphrases
- improved algorithm
- computational complexity
- dynamic programming
- detection algorithm
- significant improvement
- worst case
- experimental evaluation
- preprocessing
- recognition algorithm
- min cost
- times faster
- optimization algorithm
- segmentation algorithm
- high accuracy
- cost function
- learning algorithm
- computational cost
- np hard
- neural network
- convergence rate
- particle swarm optimization
- expectation maximization
- convex hull
- theoretical analysis
- optimal solution
- randomized algorithm
- max flow
- linear programming
- tree structure
- computationally efficient
- input data
- simulated annealing
- special case
- k means
- similarity measure
- genetic algorithm