A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees.
Kiyoko F. Aoki-KinoshitaMinoru KanehisaMing-Yang KaoXiang-Yang LiWeizhao WangPublished in: ISAAC (2006)
Keyphrases
- dynamic programming
- detection algorithm
- learning algorithm
- computational complexity
- efficient computation
- tree structure
- computational cost
- cost function
- significant improvement
- preprocessing
- k means
- np hard
- optimal solution
- similarity measure
- optimization algorithm
- three dimensional
- unordered trees
- matching algorithm
- lower bound
- approximation algorithms
- binary tree
- closed form
- expectation maximization
- polygonal approximation
- approximation ratio
- worst case
- reconstruction error
- error bounds
- high accuracy
- objective function
- decision trees