Effects of population size and mutation rate on the evolution of mutational robustness

It is often assumed that the efficiency of selection for mutational robustness would be proportional to mutation rate and population size, thus being inefficient in small populations. However, Krakauer and Plotkin (2002) hypothesized that selection in small populations would favor robustness mechanisms, such as redundancy, that mask the effect of deleterious mutations. In large populations, by contrast, selection is more effective at removing deleterious mutants and fitness would be improved by eliminating mechanisms that mask the effect of deleterious mutations and thus impede their removal. Here, we test whether these predictions are supported in experiments with evolving populations of digital organisms. Digital organisms are self-replicating programs that inhabit a virtual world inside a computer. Like their organic counterparts, digital organisms mutate, compete, evolve, and adapt by natural selection to their environment. In this study, 160 populations evolved at different combinations of mutation rate and population size. After 10(4) generations, we measured the mutational robustness of the most abundant genotype in each population. Mutational robustness tended to increase with mutation rate and to decline with population size, although the dependence with population size was in part mediated by a negative relationship between fitness and robustness. These results are independent of whether genomes were constrained to their original length or allowed to change in size.     

Global patterns in anuran–prey networks: structure mediated by latitude

Life on Earth is supported by an infinite number of interactions among organisms. Species interactions in these networks are influenced by latitude, evolutionary history and species traits. We performed a global‐scale literature analysis to build up a database of interactions between anuran communities and their preys, from a wide range of geographical areas, using a network approach. For this purpose, we compiled a total of 55 weighted anuran–prey interaction networks, 39 located in the tropics and 16 in temperate areas. We tested the influence of latitude, as well as anuran taxonomic, functional and phylogenetic richness on network metrics. We found that anuran–prey networks are not nested, exhibit low complementary specialization and modularity and high connectance when compared to other types of networks. The main effects on network metrics were related to latitude, followed by anuran taxonomic, functional and phylogenetic richness, a pattern similar to the emerging in mutualistic networks. Our study is the first integrated analysis of the structural patterns in anuran–prey antagonistic interaction networks in different parts of the world. We suggest that different processes, mediated mainly by latitude, are modeling the architecture of anuran–prey networks across the globe.     

Use of artificial neural networks for analysis of the factors affecting particle size in mebudipine nanoemulsion

In this study, a nanoemulsion containing mebudipine [composed of ethyl oleate (oil phase), Tween 80 (T80), Span 80 (S80) (surfactants), polyethylene glycol 400, ethanol (cosurfactants), and deionized water] was prepared with the aim of improving its bioavailability for an effective antihypertensive therapy. Particle size of the formulation was measured by dynamic light scattering. Then, artificial neural networks were used in identifying factors that influence the particle size of the nanoemulsion. Three variables, namely, amount of surfactant system (T80?+?S80), amount of polyethylene glycol, and amount of ethanol as cosurfactants, were considered as input values and the particle size was used as output. The developed model showed that all the three inputs had some degrees of effect on particles size: increasing the value of each input decreased the size. Furthermore, amount of surfactant was found to be the dominant factor in controlling the final particle size of nanoemulsion.

Communicated by Ramaswamy H. Sarma     

Testing the link between species interactions and species co‐occurrence in a trophic network

Species interactions are dynamic processes that vary across environmental and ecological contexts, and operate across scale boundaries, making them difficult to quantify. Nevertheless, ecologists are increasingly interested in inferring species interactions from observational data using statistical analyses of their spatial co‐occurrence patterns. Trophic interactions present a particular challenge, as predators and prey may frequently or rarely co‐occur, depending on the spatial or temporal scale of observation. In this study, we investigate the accuracy of inferred interactions among species that both compete and trophically interact. We utilized a long‐term dataset of pond‐breeding amphibian co‐occurrences from Mt Rainier National Park (Washington, USA) and compiled a new dataset of their empirical interactions from the literature. We compared the accuracy of four statistical methods in inferring these known species interactions from spatial associations. We then used the best performing statistical method, the Markov network, to further investigate the sensitivity of interaction inference to spatial scale‐dependence and the presence of predators. We show that co‐occurrence methods are generally inaccurate when estimating trophic interactions. Further the strength and sign of inferred interactions were dependent upon the spatial scale of observation and predator presence influenced the detectability of competitive interactions among prey species. However, co‐occurrence analysis revealed new patterns of spatial association among pairs of species with known interactions. Overall, our study highlights a limiting frontier in co‐occurrence theory and the disconnect between widely implemented methodologies and their ability to accurately infer interactions in trophically‐structured communities.     

Matrix metalloproteinases as target genes for gene regulatory networks driving molecular and cellular pathways related to a multistep pathogenesis of cerebrovascular disease

The present study investigated a joint contribution of matrix metalloproteinases (MMPs) genes to ischemic stroke (IS) development and analyzed interactions between MMP genes and genome-wide associated loci for IS. A total of 1288 unrelated Russians (600 IS patients and 688 healthy individuals) from Central Russia were recruited for the study. Genotyping of seven single nucleotide polymorphisms (SNPs) of MMP genes (rs1799750, rs243865, rs3025058, rs11225395, rs17576, rs486055, and rs2276109) and eight genome-wide associated loci for IS were done using Taq-Man–based assays and MALDI-TOF mass spectrometry iPLEX platform, respectively. Allele − 799T at rs11225395 of the MMP8 gene was significantly associated with a decreased risk of IS after adjustment for sex and age (OR = 0.82; 95%CI, 0.70-0.96; P = 0.016). The model-based multifactor dimensionality reduction method has revealed 21 two-order, 124 three-order, and 474 four-order gene-gene (G×G) interactions models meaningfully (P_perm < 0.05) associated with the IS risk. The bioinformatic analysis enabled establishing the studied MMP gene polymorphisms possess a clear regulatory potential and may be targeted by gene regulatory networks driving molecular and cellular pathways related to the pathogenesis of IS. In conclusion, the present study was the first to identify an association between polymorphism rs11225395 of the MMP8 gene and IS risk. The study findings also indicate that MMPs deserve special attention as a potential class of genes influencing the multistep mechanisms of cerebrovascular disease including atherosclerosis in cerebral arteries, acute cerebral artery occlusion as well as the ischemic injury of the brain and its recovery.     

Scalable remote homology detection and fold recognition in massive protein networks

The global connectivities in very large protein similarity networks contain traces of evolution among the proteins for detecting protein remote evolutionary relations or structural similarities. To investigate how well a protein network captures the evolutionary information, a key limitation is the intensive computation of pairwise sequence similarities needed to construct very large protein networks. In this article, we introduce label propagation on low-rank kernel approximation (LP-LOKA) for searching massively large protein networks. LP-LOKA propagates initial protein similarities in a low-rank graph by Nyström approximation without computing all pairwise similarities. With scalable parallel implementations based on distributed-memory using message-passing interface and Apache-Hadoop/Spark on cloud, LP-LOKA can search protein networks with one million proteins or more. In the experiments on Swiss-Prot/ADDA/CASP data, LP-LOKA significantly improved protein ranking over the widely used HMM-HMM or profile-sequence alignment methods utilizing large protein networks. It was observed that the larger the protein similarity network, the better the performance, especially on relatively small protein superfamilies and folds. The results suggest that computing massively large protein network is necessary to meet the growing need of annotating proteins from newly sequenced species and LP-LOKA is both scalable and accurate for searching massively large protein networks.