A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract).
Vincent BerryDavid BryantTao JiangPaul E. KearneyMing LiTodd WarehamHaoyong ZhangPublished in: SODA (2000)
Keyphrases
- extended abstract
- cost function
- k means
- preprocessing
- np hard
- dynamic programming
- experimental evaluation
- optimization algorithm
- tree structure
- high accuracy
- theoretical analysis
- computational cost
- unordered trees
- maximum weight
- improved algorithm
- computational complexity
- optimal solution
- segmentation algorithm
- worst case
- learning algorithm
- undirected graph
- objective function
- bayesian networks