本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2021-12-01
摘要
Background: The supertree problem, i.e., the task of finding a common refinement of a set of rooted trees is an important topic in 數學 系統發育s. The special case of a common leaf set L is known to be solvable in linear time. Existing approaches refine one input tree using 資訊 of the others and then test whether the results are isomorphic. Results: An O(k vertical bar L vertical bar) algorithm, LinCR, for constructing the common refinement T of k input trees with a common leaf set L is proposed that explicitly computes the parent function of T in a bottom-up approach. Conclusion: LinCR is simpler to implement than other asymptotically optimal algorithms for the problem and outperforms the alternatives in empirical comparisons.
※ 此為已發表論文，全文需透過期刊付費取得