An Improved Exact Algorithm for Constructing a Maximum Consensus Tree from Rooted Triples
碩士 === 國立中正大學 === 資訊工程所 === 93 === The maximum consensus tree problem is to find a rooted binary tree that can satisfy the input triples as many as possible. In this thesis, we use a branch-and-bound algorithm with the persistent data structure to solve the maximum consensus tree problem. Using the...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/49372232669428053043 |
| Summary: | 碩士 === 國立中正大學 === 資訊工程所 === 93 === The maximum consensus tree problem is to find a rooted binary tree that
can satisfy the input triples as many as possible. In this thesis, we use a
branch-and-bound algorithm with the persistent data structure to solve the
maximum consensus tree problem. Using the persistent data structure, we
can enhance the running time for branching and use less memory space to
save each subproblem. Due to these two properties, the total running time
is better, and we can deal with instances with more species.
|
|---|