本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2021
摘要
The problem of finding a common refinement of a set of rooted trees with common leaf set L appears naturally in 數學 系統發育s whenever poorly resolved 資訊 on the same taxa from different sources is to be reconciled. This constitutes a special case of the well- studied supertree problem, where the leaf sets of the input trees may differ. Algorithms that solve the rooted tree compatibility problem are of course applicable to this special case. However, they require sophisticated auxiliary data structures and have a running time of at least O(k|L| log2(k|L|)) for k input trees. Here, we show that the problem can be solved in O(k|L|) time using a simple bottom-up algorithm called LinCR. An implementation of LinCR in Python is freely available at
※ 此為已發表論文，全文需透過期刊付費取得