Cover PagePDF Available

Contemporary parallel evolution by reassembly of anciently diverged alleles.

November 2018

DOI:10.1371/image.pgen.v14.i11

Authors:

Steven M. Van Belleghem

KU Leuven

Frederik Hendrickx

Royal Belgian Institute of Natural Sciences

The drawing depicts the importance of admixture for fast and repeated evolution of two ecotypes of the saltmarsh beetle Pogonus chalceus. Long- and short-winged ecotypes of P. chalceus have diverged repeatedly along the Atlantic European coast in response to contrasting hydrological regimes. The repeated evolution is driven by an initial ancient and singular divergence of the short-winged ecotype, after which it admixed with the ancestral long-winged population. This admixture resulted in a polymorphic population that survived during the most recent glacial maxima and from which both ecotypes currently diverge rapidly and repeatedly by the reassembly of these ancient alleles when habitats become available.

Content uploaded by Steven M. Van Belleghem

Content may be subject to copyright.

Evolution at two time frames: Polymorphisms from an ancient

singular divergence event fuel contemporary parallel evolution

Steven M. Van Belleghem, Carl Vangestel, Katrien De Wolf, Zoë De Corte, Markus Möst, Pasi Rastas,

Luc De Meester, Frederik Hendrickx

Contemporary parallel evolution by reassembly of anciently diverged

alleles.

The drawing depicts the importance of admixture for fast and repeated evolution of two ecotypes

of the saltmarsh beetle Pogonus chalceus. Image Credit: Steven M. Van Belleghem and Frederik

Hendrickx.

Public Library of Science | plosgenetics.org | Volume 14 | Issue 11 | November 2018

ResearchGate has not been able to resolve any citations for this publication.

ResearchGate has not been able to resolve any references for this publication.

Article

The Trade-off Between Fast Learning and Dynamic Efficiency

In both static and dynamic, independent private values setups, the efficient allocation is implementable if the distribution of agents' values is known. Lack of knowledge about the distribution is inconsequential in the static case. But, if distribution of agents' values is not known in a dynamic framework, and if the designer gradually learns about it by observing present values, endogenously ... [Show full abstract] arising informational externalities may prevent the implementation of the efficient allocation if present observations have a large impact on expectations about the future. We provide necessary and sufficient conditions for the efficient allocation to be implementable, and we draw a parallel to situations with direct informational externalities.

Conference Paper

An Alternative Approach to HVDC Grid Protection

January 2012

In future HVDC grids, or 'Supergrids', high voltage DC circuit breakers will almost certainly be used in order to remove a faulted element of the HVDC Grid whilst allowing power flow to continue on the remaining grid. However, associated with these HVDC circuit breakers will be the need for a means of fast fault detection, location and isolation. This paper presents a none-conventional approach ... [Show full abstract] to protection, drawing parallels with AC protection and highlighting some fundamental differences.

Article

New Derivative Formulas for Integral and Probability Functions: Parallel Computations

January 1998

Stan Uryasev

New analytical differentiation formulas were recently developed for integral and probability functions. These theoretical achievements may result in new approaches and fast algorithms for practical applications, such as optimal targeting, maximizing survivability, structural reliability, and others involving integral or probability performance and constraint functions. Performance functions and ... [Show full abstract] their derivatives can be presented in a similar form that allow parallel calculations of partial derivatives with respect to control variables. An efficient sensitivity procedure calculates performance function and sensitivities during the same simulation/calculation run, resulting in savings in time and effort. Such procedure is a key element in implementing nonlinear optimization methods which need efficient and fast subroutines for calculating the gradients. This paper considers several applications.

Conference Paper

Early Stage Denial of Service Attacks in BitTorrent: An Experimental Study

January 2008 · Proceedings of the Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises, WET ICE

BitTorrent is a popular p2p file replication application, which aims at replicating a given content as fast as possible on a set of peers. The algorithms of BitTorrent used to elect remote peers with whom a peer collaborates and also which pieces of the content it offers, have proved to be highly efficient. This means that a high level of parallelism is achieved among the peers as a given peer ... [Show full abstract] always has a high chance to find another peer that holds content it is currently missing. Still, at the beginning of a BitTorrent session, pieces of the content have to be obtained from only a few peers (in general a single one called the initial seed) that hold a full copy of the file to be replicated. In this work, we aim at evaluating the ability of a BitTorrent session to survive to a denial of service attack that would disconnect the initial seed from the network. We address this issue through experimentation. Our main conclusion is that BitTorrent is highly resilient to this attack as neither the ability to obtain a full copy of the content nor the actual replication speed are affected by the disconnection of the initial seed if the attack is not carried out at the very early stage of the session.