Isometric Gene Tree Reconciliation Revisited

  • Broňa Brejová
  • Askar Gafurov
  • Dana Pardubská
  • Michal Sabo
  • Tomáš Vinař
Conference paper

DOI: 10.1007/978-3-319-43681-4_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9838)
Cite this paper as:
Brejová B., Gafurov A., Pardubská D., Sabo M., Vinař T. (2016) Isometric Gene Tree Reconciliation Revisited. In: Frith M., Storm Pedersen C. (eds) Algorithms in Bioinformatics. WABI 2016. Lecture Notes in Computer Science, vol 9838. Springer, Cham

Abstract

Isometric gene tree reconciliation is a gene tree/species tree reconciliation problem where both the gene tree and the species tree include branch lengths, and these branch lengths must be respected by the reconciliation. The problem was introduced by Ma et al. (2008a) in the context of reconstructing evolutionary histories of genomes in the infinite sites model. In this paper, we show that the original algorithm by Ma et al. (2008a) is incorrect, and we propose a modified algorithm that addresses the problems that we discovered. Moreover, by adapting a data structure by Amir et al. (2007), we were able to improve the running time from O(mn) to \(O(n+m\log m)\), where n is the size of the species tree, and m is the size of the gene tree.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Broňa Brejová
    • 1
  • Askar Gafurov
    • 1
  • Dana Pardubská
    • 1
  • Michal Sabo
    • 1
  • Tomáš Vinař
    • 1
  1. 1.Faculty of Mathematics, Physics and InformaticsComenius UniversityBratislavaSlovakia

Personalised recommendations