A Polynomial-Time Algorithm for Near-Perfect Phylogeny.
David Fernández-BacaJens LagergrenPublished in: ICALP (1996)
Keyphrases
- learning algorithm
- worst case
- computational complexity
- detection algorithm
- optimization algorithm
- dynamic programming
- times faster
- high accuracy
- theoretical analysis
- computationally efficient
- simulated annealing
- np hard
- special case
- experimental evaluation
- neural network
- segmentation algorithm
- preprocessing
- optimal solution
- strongly polynomial
- computational cost
- linear programming
- particle swarm optimization
- cost function
- constraint satisfaction problems
- k means
- convex hull