A matrix representation of phylogenetic trees

Sanzheng Qiao, William Shi Yuan Wang

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review


In this paper we begin by describing two currently used methods for evaluating phylogenetic trees, one proposed by Fitch and Margoliash [5] and the other proposed by Saitou and Nei [7]. 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.
Original languageEnglish
Title of host publicationComputing and Combinatorics - 3rd Annual International Conference COCOON 1997, Proceedings
PublisherSpringer Verlag
Number of pages10
ISBN (Print)354063357X, 9783540633570
Publication statusPublished - 1 Jan 1997
Externally publishedYes
Event3rd Annual International Computing and Combinatorics Conference, COCOON 1997 - Shanghai, China
Duration: 20 Aug 199722 Aug 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference3rd Annual International Computing and Combinatorics Conference, COCOON 1997

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'A matrix representation of phylogenetic trees'. Together they form a unique fingerprint.

Cite this