A parameter-adaptive dynamic programming approach for inferring cophylogenies

BackgroundCoevolutionary systems like hosts and their parasites are commonly used model systems for evolutionary studies. Inferring the coevolutionary history based on given phylogenies of both groups is often done by employing a set of possible types of events that happened during coevolution. Costs are assigned to the different types of events and a reconstruction of the common history with a minimal sum of event costs is sought.ResultsThis paper introduces a new algorithm and a corresponding tool called CoRe-PA, that can be used to infer the common history of coevolutionary systems. The proposed method utilizes an event-based concept for reconciliation analyses where the possible events are cospeciations, sortings, duplications, and (host) switches. All known event-based approaches so far assign costs to each type of cophylogenetic events in order to find a cost-minimal reconstruction. CoRe-PA uses a new parameter-adaptive approach, i.e., no costs have to be assigned to the coevolutionary events in advance. Several biological coevolutionary systems that have already been studied intensely in literature are used to show the performance of CoRe-PA.ConclusionFrom a biological point of view reasonable cost values for event-based reconciliations can often be estimated only very roughly. CoRe-PA is very useful when it is difficult or impossible to assign exact cost values to different types of coevolutionary events in advance.

[1]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[2]  Roderic D. M. Page,et al.  Tangled trees : phylogeny, cospeciation, and coevolution , 2003 .

[3]  U Aickelin,et al.  Handbook of metaheuristics (International series in operations research and management science) , 2005 .

[4]  Tatiana Giraud,et al.  Cophylogeny of the anther smut fungi and their caryophyllaceous hosts: Prevalence of host shifts and importance of delimiting parasite species for inferring cospeciation , 2008, BMC Evolutionary Biology.

[5]  Ran Libeskind-Hadas,et al.  On the Computational Complexity of the Reticulate Cophylogeny Reconstruction Problem , 2009, J. Comput. Biol..

[6]  Fredrik Ronquist,et al.  Parsimony analysis of coevolving species associa-tions , 2002 .

[7]  D. Aldous Stochastic models and descriptive statistics for phylogenetic trees, from Yule to today , 2001 .

[8]  Daniel Merkle,et al.  Reconstruction of the cophylogenetic history of related phylogenetic trees with divergence timing information , 2005, Theory in Biosciences.

[9]  Russell D. Gray,et al.  Drowning on arrival, missing the boat, and x-events: how likely are sorting events? , 2003 .

[10]  Kevin P. Johnson,et al.  Multiple cophylogenetic analyses reveal frequent cospeciation between pelecaniform birds and Pectinopygus lice. , 2007, Systematic biology.

[11]  Michael A. Charleston,et al.  Traversing the tangle: Algorithms and applications for cophylogenetic studies , 2006, J. Biomed. Informatics.

[12]  M. Charleston,et al.  Jungles: a new solution to the host/parasite phylogeny reconciliation problem. , 1998, Mathematical biosciences.

[13]  M. Siddall,et al.  Computer‐Intensive Randomization in Systematics , 2001 .

[14]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[15]  F. Hoffmann,et al.  Tangled Trees: Phylogeny, Cospeciation, and Coevolution , 2004 .

[16]  G. Spicer,et al.  Associations between mycophagous Drosophila and their Howardula nematode parasites: a worldwide phylogenetic shuffle , 2002, Molecular ecology.