Variation in vectorial capacity for human malaria among Anopheles mosquito species is determined by many factors, including behavior, immunity, and life history. To investigate the genomic basis of vectorial capacity and explore new avenues for vector control, we sequenced the genomes of 16 anopheline mosquito species from diverse locations spanning ~100 million years of evolution. Comparative analyses show faster rates of gene gain and loss, elevated gene shuffling on the X chromosome, and more intron losses, relative to Drosophila. Some determinants of vectorial capacity, such as chemosensory genes, do not show elevated turnover, but instead diversify through protein-sequence changes. This dynamism of anopheline genes and genomes may contribute to their flexible capacity to take advantage of new ecological niches, including adapting to humans as primary hosts.

Despite its function in sex determination and its role in driving genome evolution, the Y chromosome remains poorly understood in most species. Y chromosomes are gene-poor, repeat-rich and largely heterochromatic and therefore represent a difficult target for genetic engineering. The Y chromosome of the human malaria vector Anopheles gambiae appears to be involved in sex determination although very little is known about both its structure and function. Here, we characterize a transgenic strain of this mosquito species, obtained by transposon-mediated integration of a transgene construct onto the Y chromosome. Using meganuclease-induced homologous repair we introduce a site-specific recombination signal onto the Y chromosome and show that the resulting docking line can be used for secondary integration. To demonstrate its utility, we study the activity of a germ-line-specific promoter when located on the Y chromosome. We also show that Y-linked fluorescent transgenes allow automated sex separation of this important vector species, providing the means to generate large single-sex populations. Our findings will aid studies of sex chromosome function and enable the development of male-exclusive genetic traits for vector control.biotechnology | SIT

The draft genome sequence of Italian specimens of the Asian tiger mosquito Aedes (Stegomyia) albopictus (Diptera: Culicidae) was determined using a standard NGS (next generation sequencing) approach. The size of the assembled genome is comparable to that of Aedes aegypti; the two mosquitoes are also similar as far as the high content of repetitive DNA is concerned, most of which is made up of transposable elements. Although, based on BUSCO (Benchmarking Universal Single-Copy Orthologues) analysis, the genome assembly reported here contains more than 99% of protein-coding genes, several of those are expected to be represented in the assembly in a fragmented state. We also present here the annotation of several families of genes (tRNA genes, miRNA genes, the sialome, genes involved in chromatin condensation, sex determination genes, odorant binding proteins and odorant receptors). These analyses confirm that the assembly can be used for the study of the biology of this invasive vector of disease.

BackgroundOnly a small fraction of the mosquito species of the genus Anopheles are able to transmit malaria, one of the biggest killer diseases of poverty, which is mostly prevalent in the tropics. This diversity has genetic, yet unknown, causes. In a further attempt to contribute to the elucidation of these variances, the international “Anopheles Genomes Cluster Consortium” project (a.k.a. “16 Anopheles genomes project”) was established, aiming at a comprehensive genomic analysis of several anopheline species, most of which are malaria vectors. In the frame of the international consortium carrying out this project our team studied the genes encoding families of non-coding RNAs (ncRNAs), concentrating on four classes: microRNA (miRNA), ribosomal RNA (rRNA), small nuclear RNA (snRNA), and in particular small nucleolar RNA (snoRNA) and, finally, transfer RNA (tRNA).ResultsOur analysis was carried out using, exclusively, computational approaches, and evaluating both the primary NGS reads as well as the respective genome assemblies produced by the consortium and stored in VectorBase; moreover, the results of RNAseq surveys in cases in which these were available and meaningful were also accessed in order to obtain supplementary data, as were “pre-genomic era” sequence data stored in nucleic acid databases. The investigation included the identification and analysis, in most species studied, of ncRNA genes belonging to several families, as well as the analysis of the evolutionary relations of some of those genes in cross-comparisons to other members of the genus Anopheles.ConclusionsOur study led to the identification of members of these gene families in the majority of twenty different anopheline taxa. A set of tools for the study of the evolution and molecular biology of important disease vectors has, thus, been obtained.Electronic supplementary materialThe online version of this article (doi:10.1186/1471-2164-15-1038) contains supplementary material, which is available to authorized users.

The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessitates the development of specialized data management techniques, such as the use of shortcuts in the place of path queries. In this paper we deal with the problem of selecting the most beneficial shortcuts that reduce the execution cost of path queries in RDF databases given a space constraint. We first demonstrate that this problem is an instance of the quadratic knapsack problem. Given the computational complexity of solving such problems, we then develop an alternative formulation based on a bi-criterion linear relaxation, which essentially seeks to minimize a weighted sum of the query cost and of the required space consumption. As we demonstrate in this paper, this relaxation leads to very efficient classes of linear programming solutions. We utilize this bi-criterion linear relaxation in an algorithm that selects a subset of shortcuts to materialize. This shortcut selection algorithm is extensively evaluated and compared with a greedy algorithm that we developed in prior work. The reported experiments show that the linear relaxation algorithm manages to significantly reduce the query execution times, while also outperforming the greedy solution.