An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances

Bordewich M., Tokac N.

DISCRETE APPLIED MATHEMATICS, cilt.213, ss.47-59, 2016 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 213
  • Basım Tarihi: 2016
  • Doi Numarası: 10.1016/j.dam.2016.05.011
  • Dergi Adı: DISCRETE APPLIED MATHEMATICS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.47-59
  • Yıldız Teknik Üniversitesi Adresli: Hayır

Özet

Traditional "distance based methods" reconstruct a phylogenetic tree from a matrix of pair wise distances between taxa. A phylogenetic network is a generalisation of a phylogenetic tree that can describe evolutionary events such as reticulation and hybridisation that are not tree-like. Although evolution has been known to be more accurately modelled by a network than a tree for some time, only recently have efforts been made to directly reconstruct a phylogenetic network from sequence data, as opposed to reconstructing several trees first and then trying to combine them into a single coherent network. In this work we present a generalisation of the UPGMA algorithm for ultrametric tree reconstruction which can accurately reconstruct ultrametric tree-child networks from the set of distinct distances between each pair of taxa. (C) 2016 Elsevier B.V. All rights reserved.