An Exact and Polynomial Distance-Based Algorithm to Reconstruct Single Copy Tandem Duplication Trees.
Olivier ElementoOlivier GascuelPublished in: CPM (2003)
Keyphrases
- learning algorithm
- optimization algorithm
- expectation maximization
- experimental evaluation
- linear programming
- cost function
- decision trees
- computational complexity
- dynamic programming
- polynomially bounded
- matching algorithm
- theoretical analysis
- np hard
- search space
- preprocessing
- k means
- brute force
- high accuracy
- exact solution
- outlier detection
- three dimensional
- tree structure
- similarity measure
- detection algorithm
- clustering method
- data sets
- significant improvement
- binary tree
- convergence rate
- objective function
- particle swarm optimization
- input data
- lower bound
- simulated annealing
- knn
- computational cost
- association rules