Reconciling event-labeled gene trees with MUL-trees and species networks
- 25 Downloads
Phylogenomics commonly aims to construct evolutionary trees from genomic sequence information. One way to approach this problem is to first estimate event-labeled gene trees (i.e., rooted trees whose non-leaf vertices are labeled by speciation or gene duplication events), and to then look for a species tree which can be reconciled with this tree through a reconciliation map between the trees. In practice, however, it can happen that there is no such map from a given event-labeled tree to any species tree. An important situation where this might arise is where the species evolution is better represented by a network instead of a tree. In this paper, we therefore consider the problem of reconciling event-labeled trees with species networks. In particular, we prove that any event-labeled gene tree can be reconciled with some network and that, under certain mild assumptions on the gene tree, the network can even be assumed to be multi-arc free. To prove this result, we show that we can always reconcile the gene tree with some multi-labeled (MUL-)tree, which can then be “folded up” to produce the desired reconciliation and network. In addition, we study the interplay between reconciliation maps from event-labeled gene trees to MUL-trees and networks. Our results could be useful for understanding how genomes have evolved after undergoing complex evolutionary events such as polyploidy.
KeywordsTree reconciliation Network reconciliation Gene evolution Species evolution Phylogenetic network MUL tree Triples
Mathematics Subject Classification05C90 92D15
MH would like to thank the School of Computing Sciences, University of East Anglia, and KH and VM would like to thank the Institute of Mathematics and Computer Science, University of Greifswald, for helping to make two visits possible during which this work was conceived and developed. The authors would also like to thank the anonymous referees for their helpful comments.
- Dondi R, El-Mabrouk N, Lafond M (2016) Correction of weighted orthology and paralogy relations-complexity and algorithmic results. In: International workshop on algorithms in bioinformatics. Springer, pp 121–136Google Scholar
- Doyon JP, Scornavacca C, Gorbunov KY, Szöllősi GJ, Ranwez V, Berry V (2010) An efficient algorithm for gene/species trees parsimonious reconciliation with losses, duplications and transfers. Springer, Berlin, pp 93–108Google Scholar
- Eulenstein O, Huzurbazar S, Liberles DA (2011) Reconciling phylogenetic trees. In: Evolution after gene duplication, Chap. 10. Wiley, pp 185–206. https://doi.org/10.1002/9780470619902.ch10
- Hallett MT, Lagergren J (2001) Efficient algorithms for lateral gene transfer problems. In: Proceedings of the fifth annual international conference on computational biology. ACM, pp 149–156Google Scholar
- Lafond M, El-Mabrouk N (2015) Orthology relation and gene tree correction: complexity results. In: International workshop on algorithms in bioinformatics. Springer, pp 66–79Google Scholar
- Lafond M, Swenson KM, El-Mabrouk N (2012) An optimal reconciliation algorithm for gene trees with polytomies. In: International workshop on algorithms in bioinformatics. Springer, pp 106–122Google Scholar
- Scornavacca C, Berry V, Ranwez V (2009) From gene trees to species trees through a supertree approach. In: International conference on language and automata theory and applications. Springer, pp 702–714Google Scholar