Finding leaf-agree isomorphic subtrees from trees with disagree nodes
碩士 === 國立成功大學 === 資訊工程學系碩博士班 === 93 === The leaf-agree isomorphic(or just isomorphic) subtree problem is the following. Given k rooted trees whose leaves are drawn from the same set of items(e.g., species), find all subset of these items so that portions of the trees restricted to the subset are lea...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/73047544412078772847 |