Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance
Péter L. ErdösLajos SoukupJens StoyePublished in: CoRR (2010)
Keyphrases
- dynamic programming
- tree structure
- computational complexity
- learning algorithm
- worst case
- computational cost
- objective function
- detection algorithm
- binary trees
- binary tree
- graph structure
- convex hull
- optimization algorithm
- significant improvement
- k means
- preprocessing
- optimal solution
- probabilistic model
- experimental evaluation
- search space
- matching algorithm
- distance metric
- recognition algorithm
- weighted graph
- similarity measure
- minimum distance
- genetic algorithm