• DocumentCode
    1468382
  • Title

    Matching Split Distance for Unrooted Binary Phylogenetic Trees

  • Author

    Bogdanowicz, D. ; Giaro, K.

  • Author_Institution
    Dept. of Algorithms & Syst. Modeling, Gdansk Univ. of Technol., Gdansk, Poland
  • Volume
    9
  • Issue
    1
  • fYear
    2012
  • Firstpage
    150
  • Lastpage
    160
  • Abstract
    The reconstruction of evolutionary trees is one of the primary objectives in phylogenetics. Such a tree represents the historical evolutionary relationship between different species or organisms. Tree comparisons are used for multiple purposes, from unveiling the history of species to deciphering evolutionary associations among organisms and geographical areas. In this paper, we propose a new method of defining distances between unrooted binary phylogenetic trees that is especially useful for relatively large phylogenetic trees. Next, we investigate in detail the properties of one example of these metrics, called the Matching Split distance, and describe how the general method can be extended to nonbinary trees.
  • Keywords
    evolution (biological); genetics; trees (mathematics); evolutionary tree reconstruction; matching split distance; unrooted binary phylogenetic trees; Artificial neural networks; Bioinformatics; Bipartite graph; Computational biology; Measurement; Phylogeny; Radio frequency; Phylogenetic tree; matching split distance.; minimum-weight perfect matching; phylogenetic tree comparison; phylogenetic tree metric; splits; Algorithms; Computational Biology; Evolution, Molecular; Models, Genetic; Phylogeny;
  • fLanguage
    English
  • Journal_Title
    Computational Biology and Bioinformatics, IEEE/ACM Transactions on
  • Publisher
    ieee
  • ISSN
    1545-5963
  • Type

    jour

  • DOI
    10.1109/TCBB.2011.48
  • Filename
    5728793