An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees.
Olivier ElementoOlivier GascuelPublished in: J. Discrete Algorithms (2005)
Keyphrases
- matching algorithm
- computational cost
- dynamic programming
- learning algorithm
- optimization algorithm
- recognition algorithm
- experimental evaluation
- cost function
- significant improvement
- tree structure
- preprocessing
- worst case
- times faster
- distance measure
- segmentation algorithm
- computationally efficient
- particle swarm optimization
- convergence rate
- optimal solution
- expectation maximization
- np hard
- input data
- probabilistic model
- data sets
- unordered trees
- clustering method
- detection algorithm
- linear programming
- simulated annealing