On the Structure of Reconciliations

  • Paweł Górecki
  • Jerzy Tiuryn
Conference paper

DOI: 10.1007/978-3-540-32290-0_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3388)
Cite this paper as:
Górecki P., Tiuryn J. (2005) On the Structure of Reconciliations. In: Lagergren J. (eds) Comparative Genomics. RCG 2004. Lecture Notes in Computer Science, vol 3388. Springer, Berlin, Heidelberg

Abstract

In this paper we present an extended model related to reconciliation concepts. It is based on gene duplications, gene losses and speciation events. We define an evolutionary scenario (called a DLS-tree) which informally can represent an evolution of genes in species. We are interested in all scenarios – not only parsimonious ones. We propose a system of rules for transforming the scenarios. We prove that the system is confluent, sound and strongly normalizing. We show that a scenario in normal form (i.e. non-reducible) is unique and minimal in the sense of the cost computed as the total number of gene duplications and losses. Moreover, we present a classification of the scenarios and analyze their hierarchy. Finally, we prove that the tree in normal form could be easily transformed into the reconciled tree [12] in duplication-loss model. This solves some open problems stated in [13].

Keywords

molecular evolution phylogenetic tree reconciliation gene duplication gene loss computational biology 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Paweł Górecki
    • 1
  • Jerzy Tiuryn
    • 1
  1. 1.Institute of InformaticsWarsaw UniversityWarsawPoland

Personalised recommendations