Population genetic structure in <i>Sabatieria</i> (Nematoda) reveals intermediary gene flow and admixture between distant cold seeps from the Mediterranean Sea

BackgroundThere is a general lack of information on the dispersal and genetic structuring for populations of small-sized deep-water taxa, including free-living nematodes which inhabit and dominate the seafloor sediments. This is also true for unique and scattered deep-sea habitats such as cold seeps. Given the limited dispersal capacity of marine nematodes, genetic differentiation between such geographically isolated habitat patches is expected to be high. Against this background, we examined genetic variation in both mitochondrial (COI) and nuclear (18S and 28S ribosomal) DNA markers of 333 individuals of the genus Sabatieria, abundantly present in reduced cold-seep sediments. Samples originated from four Eastern Mediterranean cold seeps, separated by hundreds of kilometers, and one seep in the Southeast Atlantic.ResultsIndividuals from the Mediterranean and Atlantic were divided into two separate but closely-related species clades. Within the Eastern Mediterranean, all specimens belonged to a single species, but with a strong population genetic structure (ΦST = 0.149). The haplotype network of COI contained 19 haplotypes with the most abundant haplotype (52% of the specimens) shared between all four seeps. The number of private haplotypes was high (15), but the number of mutations between haplotypes was low (1–8). These results indicate intermediary gene flow among the Mediterranean Sabatieria populations with no evidence of long-term barriers to gene flow.ConclusionsThe presence of shared haplotypes and multiple admixture events indicate that Sabatieria populations from disjunct cold seeps are not completely isolated, with gene flow most likely facilitated through water current transportation of individuals and/or eggs. Genetic structure and molecular diversity indices are comparable to those of epiphytic shallow-water marine nematodes, while no evidence of sympatric cryptic species was found for the cold-seep Sabatieria

Concurrent constraint programming with process mobility

We propose an extension of concurrent constraint programming with primitives for process migration within a hierarchical network, and we study its semantics. To this purpose, we first investigate a &quot;pure &quot; paradigm for process migration, namely a paradigm where the only actions are those dealing with transmissions of processes. Our goal is to give a structural definition of the semantics of migration; namely, we want to describe the behaviour of the system, during the transmission of a process, in terms of the behaviour of the components. We achieve this goal by using a labeled transition system where the effects of sending a process, and requesting a process, are modeled by symmetric rules (similar to handshaking-rules for synchronous communication) between the two partner nodes in the network. Next, we extend our paradigm with the primitives of concurrent constraint programming, and we show how to enrich the semantics to cope with the notions of environment and constraint store. Finally, we show how the operational semantics can be used to define an interpreter for the basic calculus.

Distributed Branching Bisimulation Minimization by Inductive Signatures

We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement process and the signatures have been optimized to exploit the fact that the input graph contains no tau-loops. The optimization in the refinement process is meant to reduce both the number of iterations needed and the memory requirements. In the former case we cannot prove that there is an improvement, but our experiments show that in many cases the number of iterations is smaller. In the latter case, we can prove that the worst case memory use of the new algorithm is linear in the size of the state space, whereas the old algorithm has a quadratic upper bound. The paper includes a proof of correctness of the new algorithm and the results of a number of experiments that compare the performance of the old and the new algorithms