Algorithms in Bioinformatics

A   A   A
Home > Publications > Building species trees from larger parts of phylogenomic databases

Skip to content. | Skip to navigation

Document Actions

Celine Scornavacca, V Berry, and V Ranwez (2011)

Building species trees from larger parts of phylogenomic databases

Information and Computation, 209(3):590-605.

Gene trees are leaf-labeled trees inferred from molecular sequences. Because of gene duplication events arising in genomes, some species host several copies of the same gene, hence individual gene trees usually have several leaves labeled with identical species names. Dealing with such multi-labeled gene trees (MUL trees) is a substantial problem in phylogenomics, e.g. current supertree methods do not handle MUL trees, which restricts studies aimed at building the Tree of Life to a very small core of mono-copy genes. We propose to tackle this problem by mainly transforming a collection of MUL trees into a collection of trees, each containing single copies of labels. To achieve that aim, we provide several fast algorithmic building stones and describe how they fit in a general framework to build a species tree. First, we propose to separately preprocess each MUL tree in order to remove its redundant parts with respect to speciation events. For this purpose, we present a tree isomorphism algorithm for MUL trees to reduce redundant parts of these trees. Second, we show how the speciation signal contained in a MUL tree can be represented by a linear set of triplets. When this set is topologically coherent (compatible), we show that it can be used to produce a single-copy gene tree to replace the MUL tree while preserving the information it contains on speciation events. As an alternative approach, we propose to extract from each MUL tree a maximum size subtree that is free of duplication events. The algorithms are finally applied in a supertree analysis of HOGENOM, a database of homologous genes from fully sequenced genomes.
DOI: 10.1016/j.ic.2010.11.022
« June 2019 »