Evolutionary biology: genetics and bisexuality.

A population-genetic model indicates that if there is a gene responsible for homosexual behaviour it can readily spread in populations. The model also predicts widespread bisexuality in humans.

Evolutionary implications of a high selfing rate in the freshwater snail Lymnaea truncatula.

Self-compatible hermaphroditic organisms that mix self-fertilization and outcrossing are of great interest for investigating the evolution of mating systems. We investigate the evolution of selfing in Lymnaea truncatula, a self-compatible hermaphroditic freshwater snail. We first analyze the consequences of selfing in terms of genetic variability within and among populations and then investigate how these consequences along with the species ecology (harshness of the habitat and parasitism) might govern the evolution of selfing. Snails from 13 localities (classified as temporary or permanent depending on their water availability) were sampled in western Switzerland and genotyped for seven microsatellite loci. F(IS) (estimated on adults) and progeny array analyses (on hatchlings) provided similar selfing rate estimates of 80%. Populations presented a low polymorphism and were highly differentiated (F(ST) = 0.58). Although the reproductive assurance hypothesis would predict higher selfing rate in temporary populations, no difference in selfing level was observed between temporary and permanent populations. However, allelic richness and gene diversity declined in temporary habitats, presumably reflecting drift. Infection levels varied but were not simply related to either estimated population selfing rate or to differences in heterozygosity. These findings and the similar selfing rates estimated for hatchlings and adults suggest that within-population inbreeding depression is low in L. truncatula.

An iterative Multiscale Finite-Volume algorithm converging to the exact solution

The multiscale finite volume (MsFV) method has been developed to efficiently solve large heterogeneous problems (elliptic or parabolic); it is usually employed for pressure equations and delivers conservative flux fields to be used in transport problems. The method essentially relies on the hypothesis that the (fine-scale) problem can be reasonably described by a set of local solutions coupled by a conservative global (coarse-scale) problem. In most cases, the boundary conditions assigned for the local problems are satisfactory and the approximate conservative fluxes provided by the method are accurate. In numerically challenging cases, however, a more accurate localization is required to obtain a good approximation of the fine-scale solution. In this paper we develop a procedure to iteratively improve the boundary conditions of the local problems. The algorithm relies on the data structure of the MsFV method and employs a Krylov-subspace projection method to obtain an unconditionally stable scheme and accelerate convergence. Two variants are considered: in the first, only the MsFV operator is used; in the second, the MsFV operator is combined in a two-step method with an operator derived from the problem solved to construct the conservative flux field. The resulting iterative MsFV algorithms allow arbitrary reduction of the solution error without compromising the construction of a conservative flux field, which is guaranteed at any iteration. Since it converges to the exact solution, the method can be regarded as a linear solver. In this context, the schemes proposed here can be viewed as preconditioned versions of the Generalized Minimal Residual method (GMRES), with a very peculiar characteristic that the residual on the coarse grid is zero at any iteration (thus conservative fluxes can be obtained).

Proposal of a parallel architecture for a motion detection algorithm

This paper proposes a parallel architecture for estimation of the motion of an underwater robot. It is well known that image processing requires a huge amount of computation, mainly at low-level processing where the algorithms are dealing with a great number of data. In a motion estimation algorithm, correspondences between two images have to be solved at the low level. In the underwater imaging, normalised correlation can be a solution in the presence of non-uniform illumination. Due to its regular processing scheme, parallel implementation of the correspondence problem can be an adequate approach to reduce the computation time. Taking into consideration the complexity of the normalised correlation criteria, a new approach using parallel organisation of every processor from the architecture is proposed

Speculative parallelization of multipath radiosity algorithm

In computer graphics, global illumination algorithms take into account not only the light that comes directly from the sources, but also the light interreflections. This kind of algorithms produce very realistic images, but at a high computational cost, especially when dealing with complex environments. Parallel computation has been successfully applied to such algorithms in order to make it possible to compute highly-realistic images in a reasonable time. We introduce here a speculation-based parallel solution for a global illumination algorithm in the context of radiosity, in which we have taken advantage of the hierarchical nature of such an algorithm

A Monte Carlo-Based Fiber Tracking Algorithm using Diffusion Tensor MRI

Diffusion tensor magnetic resonance imaging, which measures directional information of water diffusion in the brain, has emerged as a powerful tool for human brain studies. In this paper, we introduce a new Monte Carlo-based fiber tracking approach to estimate brain connectivity. One of the main characteristics of this approach is that all parameters of the algorithm are automatically determined at each point using the entropy of the eigenvalues of the diffusion tensor. Experimental results show the good performance of the proposed approach

Evolutionary histories of expanded peptidase families in Schistosoma mansoni

Schistosoma mansoni is one of the three main causative agents of human schistosomiasis, a major health problem with a vast socio-economic impact. Recent advances in the proteomic analysis of schistosomes have revealed that peptidases are the main virulence factors involved in the pathogenesis of this disease. In this context, evolutionary studies can be applied to identify peptidase families that have been expanded in genomes over time in response to different selection pressures. Using a phylogenomic approach, we searched for expanded endopeptidase families in the S. mansoni predicted proteome with the aim of contributing to the knowledge of such enzymes as potential therapeutic targets. We found three endopeptidase families that comprise leishmanolysins (metallopeptidase M8 family), cercarial elastases (serine peptidase S1 family) and cathepsin D proteins (aspartic peptidase A1 family). Our results suggest that the Schistosoma members of these families originated from successive gene duplication events in the parasite lineage after its diversification from other metazoans. Overall, critical residues are conserved among the duplicated genes/proteins. Furthermore, each protein family displays a distinct evolutionary history. Altogether, this work provides an evolutionary view of three S. mansoni peptidase families, which allows for a deeper understanding of the genomic complexity and lineage-specific adaptations potentially related to the parasitic lifestyle.

Pfcrt haplotypes and the evolutionary history of chloroquine-resistant Plasmodium falciparum

Mutations in the Pfcrt gene that change the resulting amino acids and form different haplotypes are common and correlate with the prevalence of chloroquine resistant (CQR) field isolates of the malaria parasite, Plasmodium falciparum. This correlation provides opportunities to infer the global evolutionary history of CQ resistance by analysing CQR Pfcrt haplotype data. We collated data on the Pfcrt haplotypes from different global studies and performed evolutionary genetic analysis to present comprehensive and comparative information on the global distribution of five major CQR-Pfcrt haplotypes and evolutionary inter-relationships among 38 different countries. Using the haplotype diversity data, inter-continental genetic differentiation was also ascertained.

Constraint algorithm for k-presymplectic Hamiltonian systems. Application to singular field theories

The k-symplectic formulation of field theories is especially simple, since only tangent and cotangent bundles are needed in its description. Its defining elements show a close relationship with those in the symplectic formulation of mechanics. It will be shown that this relationship also stands in the presymplectic case. In a natural way,one can mimick the presymplectic constraint algorithm to obtain a constraint algorithmthat can be applied to k-presymplectic field theory, and more particularly to the Lagrangian and Hamiltonian formulations offield theories defined by a singular Lagrangian, as well as to the unified Lagrangian-Hamiltonian formalism (Skinner--Rusk formalism) for k-presymplectic field theory. Two examples of application of the algorithm are also analyzed.