In this paper we begin by describing two currently used methods for evaluating phylogenetic trees, one proposed by Fitch and Margoliash  and the other proposed by Saitou and Nei . Both methods are heuristic in the sense that not all possible trees are tested to ensure that the best solution has been reached. We develop a matrix representation of unrooted binary trees. The problem of evaluating phylogenetic trees is then transformed into the standard linear least squares problem. Then we propose a matrix decomposition method for evaluating phylogenetic trees.
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||3rd Annual International Computing and Combinatorics Conference, COCOON 1997|
|Period||20/08/97 → 22/08/97|
- Theoretical Computer Science
- Computer Science(all)