RASCAL: A Randomized Approach for Coevolutionary Analysis

Diversification processes between monogenoids (Dactylogyridae) and their marine catfish (Siluriformes: Ariidae) from the Atlantic coast of South America

Due to their high specificity, monogenoids from fish provide an interesting model to study historical associations of hosts and parasites. High agreement between host and parasite phylogeny is often interpreted as evidence of cospeciation. However, cophylogenetic signal may also arise from other, either adaptive or non-adaptive, processes. We applied the recently developed Cophylospace Framework to better understand the evolutionary relationship between monogenoids and marine catfish from the Atlantic coast of South America. The associations between 12 marine catfish and 10 monogenoid species were assessed. Molecular data of host and parasite species were used for phylogenetic reconstruction. We used anchor morphology based on Procrustes coordinates to evaluate whether closely related hosts are associated with morphologically similar parasites. To assess the association between parasite phylogeny and host morphology, we produced a distance matrix based on morphological characters of catfishes. Agreement between phylogenies and between phylogeny and morphology was measured using Procrustes R² computed with PACo. The parasite phylogeny obtained in this study represents the first complete phylogenetic hypothesis of monogenoids parasitizing ariids from South America. The Cophylospace analysis suggested that phylogenetic and morphological distance of monogenoids contributes similarly to explain the pattern of host–parasite associations, whereas parasite phylogeny is more strongly associated with the morphological traits of the hosts than with host phylogeny. This evidence suggests that cospeciation is not a major force accounting for diversification in the monogenoids studied. Rather host morphological traits seem to be a more important driver, which conforms with evidence from other host‒monogenoid systems.

Next-generation cophylogeny: unravelling eco-evolutionary processes

A fundamental question in evolutionary biology is how microevolutionary processes translate into species diversification. Cophylogeny provides an appropriate framework to address this for symbiotic associations, but historically has been primarily limited to unveiling patterns. We argue that it is essential to integrate advances from ecology and evolutionary biology into cophylogeny, to gain greater mechanistic insights and transform cophylogeny into a platform to advance understanding of interspecific interactions and diversification more widely. We discuss key directions, such as incorporating trait reconstruction and considering multiple scales of network organization, and highlight recent developments for implementation. A new quantitative framework is proposed to allow integration of relevant information, such as quantitative traits and assessment of the contribution of individual mechanisms to cophylogenetic patterns.

A geography-aware reconciliation method to investigate diversification patterns in host/parasite interactions

Cospeciation studies aim at investigating whether hosts and symbionts speciate simultaneously or whether the associations diversify through host shifts. This problem is often tackled through reconciliation analyses that map the symbiont phylogeny onto the host phylogeny by mixing different types of diversification events. These reconciliations can be difficult to interpret and are not always biologically realistic. Researchers have underlined that the biogeographic histories of both hosts and symbionts influence the probability of cospeciation and host switches, but up to now no reconciliation software integrates geographic data. We present a new functionality in the Mowgli software that bridges this gap. The user can provide geographic information on both the host and symbiont extant and ancestral taxa. Constraints in the reconciliation algorithm have been implemented to generate biologically realistic codiversification scenarios. We apply our method to the fig/fig wasp association and infer diversification scenarios that differ from reconciliations ignoring geographic information. In addition, we updated the reconciliation viewer SylvX to visualize ancestral character states on the phylogenetic trees and highlight parts of reconciliations that are geographically inconsistent when not accounting for geographic constraints. We suggest that the comparison of reconciliations obtained with and without such constraints can help solving ambiguities in the biogeographic histories of the partners. With the development of robust methods in historical biogeography, and the advent of next-generation sequencing that leads to better-resolved trees, a geography-aware reconciliation method represents a substantial advance that is likely to be useful to researchers studying the evolution of biotic interactions and biogeography.

Towards sub-quadratic time and space complexity solutions for the dated tree reconciliation problem

Background

Recent coevolutionary analysis has considered tree topology as a means to reduce the asymptotic complexity associated with inferring the complex coevolutionary interrelationships that arise between phylogenetic trees. Targeted algorithmic design for specific tree topologies has to date been highly successful, with one recent formulation providing a logarithmic space complexity reduction for the dated tree reconciliation problem.

Methods

In this work we build on this prior analysis providing a further asymptotic space reduction, by providing a new formulation for the dynamic programming table used by a number of popular coevolutionary analysis techniques. This model gives rise to a sub quadratic running time solution for the dated tree reconciliation problem for selected tree topologies, and is shown to be, in practice, the fastest method for solving the dated tree reconciliation problem for expected evolutionary trees. This result is achieved through the analysis of not only the topology of the trees considered for coevolutionary analysis, but also the underlying structure of the dynamic programming algorithms that are traditionally applied to such analysis.

Conclusion

The newly inferred theoretical complexity bounds introduced herein are then validated using a combination of synthetic and biological data sets, where the proposed model is shown to provide an \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(\sqrt{n})$$\end{document}O(n) space saving, while it is observed to run in half the time compared to the fastest known algorithm for solving the dated tree reconciliation problem. What is even more significant is that the algorithm derived herein is able to guarantee the optimality of its inferred solution, something that algorithms of comparable speed have to date been unable to achieve.