A Linear Time Algorithm for Error-Corrected Reconciliation of Unrooted Gene Trees

  • Paweł Górecki
  • Oliver Eulenstein
Conference paper

DOI: 10.1007/978-3-642-21260-4_17

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6674)
Cite this paper as:
Górecki P., Eulenstein O. (2011) A Linear Time Algorithm for Error-Corrected Reconciliation of Unrooted Gene Trees. In: Chen J., Wang J., Zelikovsky A. (eds) Bioinformatics Research and Applications. ISBRA 2011. Lecture Notes in Computer Science, vol 6674. Springer, Berlin, Heidelberg

Abstract

Evolutionary methods are increasingly challenged by the fast growing resources of genomic sequence information. Fundamental evolutionary events, like gene duplication, loss, and deep coalescence, account more then ever for incongruence between gene trees and the actual species tree. Gene tree reconciliation is addressing this fundamental problem by invoking the minimum number of gene-duplication and losses that reconcile a gene tree with a species tree. Despite its promise, gene tree reconciliation assumes the gene trees to be correctly rooted and free of error, which severely limits its application in practice. Here we present a novel linear time algorithm for error-corrected gene tree reconciliation of unrooted gene trees. Furthermore, in an empirical study on yeast genomes we successfully demonstrate the ability of our algorithm to (i) reconcile (cure) error-prone gene trees, and (ii) to improve on more advanced evolutionary applications that are based on gene tree reconciliation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Paweł Górecki
    • 1
  • Oliver Eulenstein
    • 2
  1. 1.Institute of InformaticsWarsaw UniversityPoland
  2. 2.Department of Computer ScienceIowa State UniversityUSA

Personalised recommendations