Abstract
In reconstructing the common evolutionary history of hosts and parasites, the current method of choice is the phylogenetic tree reconciliation. In this model, we are given a host tree H, a parasite tree P, and a function \(\sigma \) mapping the leaves of P to the leaves of H and the goal is to find, under some biologically motivated constraints, a reconciliation, that is a function from the vertices of P to the vertices of H that respects \(\sigma \) and allows the identification of biological events such as co-speciation, duplication and host switch. The maximum co-divergence problem consists in finding the maximum number of co-speciations in a reconciliation. This problem is NP-hard for arbitrary phylogenetic trees and no approximation algorithm is known. In this paper we consider the influence of tree topology on the maximum co-divergence problem. In particular we focus on a particular tree structure, namely caterpillar, and show that—in this case—the heuristics that are mostly used in the literature provide solutions that can be arbitrarily far from the optimal value. Then, we prove that finding the max co-divergence is equivalent to compute the maximum length of a subsequence with certain properties of a given permutation. This equivalence leads to two consequences: (1) it shows that we can compute efficiently in polynomial time the optimal time-feasible reconciliation and (2) it can be used to understand how much the tree topology influences the value of the maximum number of co-speciations.
Similar content being viewed by others
References
Bansal MS, Alm E, Kellis M (2012) Efficient algorithms for the reconciliation problem with gene duplication, horizontal transfer and loss. Bioinformatics 28(12):i283–i291
Bespamyatnikh S, Segal M (2000) Enumerating longest increasing subsequences and patience sorting. Inf Process Lett 76(1):7–11
Charleston MA (1998) Jungles: a new solution to the host/parasite phylogeny reconciliation problem. Math Biosci 149(2):191–223
Charleston MA (2003) Recent results in cophylogeny mapping. Adv Parasitol 54:303–330
Donati B, Baudet C, Sinaimeri B, Crescenzi P, Sagot M (2015) Eucalypt: efficient tree reconciliation enumerator. Algorithms Mol Biol 10(1):3
Doyon JP, Ranwez V, Daubin V, Berry V (2011a) Models, algorithms and programs for phylogeny reconciliation. Brief Bioinform 12(5):392–400
Doyon JP, Scornavacca C, Gorbunov KY, Szöllősi GJ, Ranwez V, Berry V (2011b) An efficient algorithm for gene/species trees parsimonious reconciliation with losses, duplications and transfers. In: Tannier E (ed) Proceedings of the 8th annual RECOMB satellite workshop on comparative genomics (RECOMB-CG 2010), lecture notes in bioinformatics, vol 6398. Springer, Berlin, pp 93–108
Hammersley JM (1972) A few seedlings of research. In: Proceedings of the sixth Berkeley symposium on mathematical statistics and probability (University of California, Berkeley, CA, 1970/1971), pp 345–394
Merkle D, Middendorf M (2005) Reconstruction of the cophylogenetic history of related phylogenetic trees with divergence timing information. Theory Biosci 123:277–299
Ovadia Y, Fielder D, Conow C, Libeskind-Hadas R (2011) The cophylogeny reconstruction problem is NP-complete. J Comput Biol 18(1):59–65
Page RDM (1994) Parallel phylogenies: reconstructing the history of host-parasite assemblages. Cladistics 10(2):155–173
Page RDM (2003) Tangled trees: phylogeny, cospeciation and coevolution. The University of Chicago Press, Chicago
Romik D (2015) The surprising mathematics of longest increasing subsequences. Institute of Mathematical Statistics Textbooks, Cambridge University Press, Cambridge
Ronquist F (1995) Reconstructing the history of host–parasite associations using generalised parsimony. Cladistics 11(1):73–89
Stolzer ML, Lai H, Xu M, Sathaye D, Vernot B, Durand D (2012) Inferring duplications, losses, transfers and incomplete lineage sorting with nonbinary species trees. Bioinformatics 28(18):i409–i415
Tofigh A, Hallett M, Lagergren J (2011) Simultaneous identification of duplications and lateral gene transfers. J IEEE/ACM Trans Comput Biol Bioinform 8(2):517–535
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Research carried on while the B. Sinaimeri was visiting the Computer Science Department of Sapienza University of Rome. This work has been partially supported by Sapienza University of Rome, project “Combinatorial structures and algorithms for problems in co-phylogeny”.
Rights and permissions
About this article
Cite this article
Calamoneri, T., Monti, A. & Sinaimeri, B. Co-divergence and tree topology. J. Math. Biol. 79, 1149–1167 (2019). https://doi.org/10.1007/s00285-019-01385-w
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00285-019-01385-w