An Improved Algorithm for Compatible Supertree Problem
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 97 === Finding supertrees is critical in evolutionary biology. A semi-labeled tree T is a rooted tree satisfies the following: (1) each node in T has zero to multiple labels, (2) each label in T appears only once, and (3) all leaves and non-branching internal nodes hav...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/53018166415388675605 |