| Summary: | 碩士 === 國立中正大學 === 資訊工程所 === 95 === A phylogenetic tree, also called an evolutionary tree, is a tree showing the
evolutionary interrelationships among various species that are believed to
have a common ancestor. In a phylogenetic tree, each node with descendants
represents the most recent common ancestor of the descendants, with
edge lengths sometimes corresponding to time estimates. In this thesis, we
consider the related problem that is given a distance matrix which represent
distnace among pairwise species and reconstructs the evolutionary tree of
these species under the criterion called OLS (Original Least Square error).
To find the optimal tree under OLS criterion, we need to cinsider a huge
searching spcae. So we will give a branch-and-bound algorithm to find the
optimal tree in this paper.
|
|---|
