CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2013 vol.10 Issue No.02 - March-April

Subscribe

Issue No.02 - March-April (2013 vol.10)

pp: 522-536

Pawel Gorecki , Dept. of Math., Inf. & Mech., Univ. of Warsaw, Warsaw, Poland

Oliver Eulenstein , Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA

Jerzy Tiuryn , Dept. of Math., Inf. & Mech., Univ. of Warsaw, Warsaw, Poland

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2013.22

ABSTRACT

Tree comparison functions are widely used in phylogenetics for comparing evolutionary trees. Unrooted trees can be compared with rooted trees by identifying all rootings of the unrooted tree that minimize some provided comparison function between two rooted trees. The plateau property is satisfied by the provided function, if all optimal rootings form a subtree, or plateau, in the unrooted tree, from which the rootings along every path toward a leaf have monotonically increasing costs. This property is sufficient for the linear-time identification of all optimal rootings and rooting costs. However, the plateau property has only been proven for a few rooted comparison functions, requiring individual proofs for each function without benefitting from inherent structural features of such functions. Here, we introduce the consistency condition that is sufficient for a general function to satisfy the plateau property. For consistent functions, we introduce general linear-time solutions that identify optimal rootings and all rooting costs. Further, we identify novel relationships between consistent functions in terms of plateaus, especially the plateau of the well-studied duplication-loss function is part of a plateau of every other consistent function. We introduce a novel approach for identifying consistent cost functions by defining a formal language of Boolean costs. Formulas in this language can be interpreted as cost functions. Finally, we demonstrate the performance of our general linear-time solutions in practice using empirical and simulation studies.

INDEX TERMS

Vegetation, Radio frequency, Cost function, Search problems, Bioinformatics, Phylogeny, IEEE transactions,formal language, Vegetation, Radio frequency, Cost function, Search problems, Bioinformatics, Phylogeny, IEEE transactions, Boolean cost, Reconciliation, unrooted gene tree, species tree, evolutionary cost, gene duplication, gene loss, speciation, deep coalescence, Robinson-Foulds distance

CITATION

Pawel Gorecki, Oliver Eulenstein, Jerzy Tiuryn, "Unrooted Tree Reconciliation: A Unified Approach",

*IEEE/ACM Transactions on Computational Biology and Bioinformatics*, vol.10, no. 2, pp. 522-536, March-April 2013, doi:10.1109/TCBB.2013.22REFERENCES