Isometric Gene Tree Reconciliation Revisited
Isometric gene tree reconciliation is a gene tree/species tree reconciliation problem where both the gene tree and the species tree include branch lengths, and these branch lengths must be respected by the reconciliation. The problem was introduced by Ma et al. (2008a) in the context of reconstructing evolutionary histories of genomes in the infinite sites model. In this paper, we show that the original algorithm by Ma et al. (2008a) is incorrect, and we propose a modified algorithm that addresses the problems that we discovered. Moreover, by adapting a data structure by Amir et al. (2007), we were able to improve the running time from O(mn) to \(O(n+m\log m)\), where n is the size of the species tree, and m is the size of the gene tree.
This research was funded by a grant from the Slovak Research and Development Agency APVV-14-0253 and by VEGA grants 1/0684/16, 1/0719/14, and 2/0165/16.
- Doyon, J.-P., Scornavacca, C., Gorbunov, K.Y., Szöllősi, G.J., Ranwez, V., Berry, V.: An efficient algorithm for gene/species trees parsimonious reconciliation with losses, duplications and transfers. In: Tannier, E. (ed.) RECOMB-CG 2010. LNCS, vol. 6398, pp. 93–108. Springer, Heidelberg (2010)CrossRefGoogle Scholar
- Eulenstein, O.: A linear time algorithm for tree mapping. GMD-Forschungszentrum Informationstechnik (1997)Google Scholar
- Felsenstein, J.: Inferring Phylogenies. Sinauer Associates, Sunderland (2004)Google Scholar