Minimum-Width Drawings of Phylogenetic Trees.
COCOA(2019)
摘要
We show that finding a minimum-width orthogonal upward drawing of a phylogenetic tree is NP-hard for binary trees with unconstrained combinatorial order and provide a linear-time algorithm for ordered trees. We also study several heuristic algorithms for the unconstrained case and show their effectiveness through experimentation.
更多查看译文
关键词
Phylogenetic, Tree drawing, Orthogonal, Upward
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络