Balanced vertices in trees and a simpler algorithm to compute the genomic distance.
Péter L. ErdösLajos SoukupJens StoyePublished in: Appl. Math. Lett. (2011)
Keyphrases
- matching algorithm
- computational complexity
- experimental evaluation
- tree edit distance
- worst case
- k means
- cost function
- tree structure
- distance function
- optimal solution
- preprocessing
- np hard
- distance transform
- computational cost
- search algorithm
- objective function
- similarity measure
- decision trees
- hamiltonian cycle
- attributed graphs
- binary trees
- neural network
- tree construction
- weighted graph
- distance measure
- genetic algorithm