A quasi-experimental study to estimate effectiveness of seasonal malaria chemoprevention in Aweil South County in Northern Bahr El Ghazal, South Sudan.

BACKGROUND: Seasonal malaria chemoprevention (SMC) is an effective intervention to prevent malaria in children in locations where the burden of malaria is high and transmission is seasonal. There is growing evidence suggesting that SMC with sulfadoxine-pyrimethamine and amodiaquine can retain its high level of effectiveness in East and Southern Africa despite resistance concerns. This study aims to generate evidence on the effectiveness of SMC when delivered under programmatic conditions in an area with an unknown anti-malarial drug resistance profile in the Northern Bahr el-Ghazal region of South Sudan. METHODS: A non-randomized quasi experimental study was conducted to compare an intervention county with a control county. Five monthly SMC cycles were delivered between July and November 2022, targeting about 19,000 children 3-59 months old. Data were obtained from repeated cross-sectional household surveys of caregivers of children aged 3-59 months using cluster sampling. Wave 1 survey took place in both counties before SMC implementation; Waves 2 and 3 took place after the second and fourth monthly SMC cycles. Difference-in-differences analyses were performed by fitting logistic regression models with interactions between county and wave. RESULTS: A total of 2760 children were sampled in the study across the three survey waves in both study counties. Children in the intervention arm had 70% lower odds of caregiver-reported fever relative to those in the control arm during the one-month period prior to Wave 2 (OR: 0.30, 95% CI 0.12-0.70, p = 0.003), and 37% lower odds in Wave 3 (OR: 0.63, 95% CI 0.22-1.59, p = 0.306) after controlling for baseline difference between counties in Wave 1. Odds of caregiver-reported RDT-confirmed malaria were 82% lower in the previous 1-month period prior to Wave 2 (OR: 0.18, 95% CI 0.07-0.49, p = 0.001) and Wave 3 (OR: 0.18, 95% CI 0.06-0.54, p = 0.003). CONCLUSION: These results show high effectiveness of SMC using SPAQ in terms of reducing malaria disease during the high transmission season in children 3-59 month. Despite the promising results, additional evidence and insights from chemoprevention efficacy cohort studies, and analyses of relevant resistance markers, are required to assess the suitability of SMC for this specific context.

An incrementally updatable and scalable system for large-scale sequence search using the Bentley-Saxe transformation.

MOTIVATION: In the past few years, researchers have proposed numerous indexing schemes for searching large datasets of raw sequencing experiments. Most of these proposed indexes are approximate (i.e. with one-sided errors) in order to save space. Recently, researchers have published exact indexes-Mantis, VariMerge and Bifrost-that can serve as colored de Bruijn graph representations in addition to serving as k-mer indexes. This new type of index is promising because it has the potential to support more complex analyses than simple searches. However, in order to be useful as indexes for large and growing repositories of raw sequencing data, they must scale to thousands of experiments and support efficient insertion of new data. RESULTS: In this paper, we show how to build a scalable and updatable exact raw sequence-search index. Specifically, we extend Mantis using the Bentley-Saxe transformation to support efficient updates, called Dynamic Mantis. We demonstrate Dynamic Mantis's scalability by constructing an index of ≈40K samples from SRA by adding samples one at a time to an initial index of 10K samples. Compared to VariMerge and Bifrost, Dynamic Mantis is more efficient in terms of index-construction time and memory, query time and memory and index size. In our benchmarks, VariMerge and Bifrost scaled to only 5K and 80 samples, respectively, while Dynamic Mantis scaled to more than 39K samples. Queries were over 24× faster in Mantis than in Bifrost (VariMerge does not immediately support general search queries we require). Dynamic Mantis indexes were about 2.5× smaller than Bifrost's indexes and about half as big as VariMerge's indexes. AVAILABILITY AND IMPLEMENTATION: Dynamic Mantis implementation is available at https://github.com/splatlab/mantis/tree/mergeMSTs. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Cuttlefish: fast, parallel and low-memory compaction of de Bruijn graphs from large-scale genome collections.

MOTIVATION: The construction of the compacted de Bruijn graph from collections of reference genomes is a task of increasing interest in genomic analyses. These graphs are increasingly used as sequence indices for short- and long-read alignment. Also, as we sequence and assemble a greater diversity of genomes, the colored compacted de Bruijn graph is being used more and more as the basis for efficient methods to perform comparative genomic analyses on these genomes. Therefore, time- and memory-efficient construction of the graph from reference sequences is an important problem. RESULTS: We introduce a new algorithm, implemented in the tool Cuttlefish, to construct the (colored) compacted de Bruijn graph from a collection of one or more genome references. Cuttlefish introduces a novel approach of modeling de Bruijn graph vertices as finite-state automata, and constrains these automata's state-space to enable tracking their transitioning states with very low memory usage. Cuttlefish is also fast and highly parallelizable. Experimental results demonstrate that it scales much better than existing approaches, especially as the number and the scale of the input references grow. On a typical shared-memory machine, Cuttlefish constructed the graph for 100 human genomes in under 9 h, using ∼29 GB of memory. On 11 diverse conifer plant genomes, the compacted graph was constructed by Cuttlefish in under 9 h, using ∼84 GB of memory. The only other tool completing these tasks on the hardware took over 23 h using ∼126 GB of memory, and over 16 h using ∼289 GB of memory, respectively. AVAILABILITY AND IMPLEMENTATION: Cuttlefish is implemented in C++14, and is available under an open source license at https://github.com/COMBINE-lab/cuttlefish. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Biallelic variants in FBXL3 cause intellectual disability, delayed motor development and short stature.

FBXL3 (F-Box and Leucine Rich Repeat Protein 3) encodes a protein that contains an F-box and several tandem leucine-rich repeats (LRR) domains. FBXL3 is part of the SCF (Skp1-Cullin-F box protein) ubiquitin ligase complex that binds and leads to phosphorylation-dependent degradation of the central clock protein cryptochromes (CRY1 and CRY2) by the proteasome and its absence causes circadian phenotypes in mice and behavioral problems. No FBXL3-related phenotypes have been described in humans. By a combination of exome sequencing and homozygosity mapping, we analyzed two consanguineous families with intellectual disability and identified homozygous loss-of-function (LoF) variants in FBXL3. In the first family, from Pakistan, an FBXL3 frameshift variant [NM_012158.2:c.885delT:p.(Leu295Phefs*25)] was the onlysegregating variant in five affected individuals in two family loops (LOD score: 3.12). In the second family, from Lebanon, we identified a nonsense variant [NM_012158.2:c.445C>T:p.(Arg149*)]. In a third patient from Italy, a likely deleterious non-synonymous variant [NM_012158.2:c.1072T>C:p.(Cys358Arg)] was identified in homozygosity. Protein 3D modeling predicted that the Cys358Arg change influences the binding with CRY2 by destabilizing the structure of the FBXL3, suggesting that this variant is also likely to be LoF. The eight affected individuals from the three families presented with a similar phenotype that included intellectual disability, developmental delay, short stature and mild facial dysmorphism, mainly large nose with a bulbous tip. The phenotypic similarity and the segregation analysis suggest that FBXL3 biallelic, LoF variants link this gene with syndromic autosomal recessive developmental delay/intellectual disability.

Biallelic variants in LINGO1 are associated with autosomal recessive intellectual disability, microcephaly, speech and motor delay.

PURPOSE: To elucidate the novel molecular cause in two unrelated consanguineous families with autosomal recessive intellectual disability. METHODS: A combination of homozygosity mapping and exome sequencing was used to locate the plausible genetic defect in family F162, while only exome sequencing was followed in the family PKMR65. The protein 3D structure was visualized with the University of California-San Francisco Chimera software. RESULTS: All five patients from both families presented with severe intellectual disability, aggressive behavior, and speech and motor delay. Four of the five patients had microcephaly. We identified homozygous missense variants in LINGO1, p.(Arg290His) in family F162 and p.(Tyr288Cys) in family PKMR65. Both variants were predicted to be pathogenic, and segregated with the phenotype in the respective families. Molecular modeling of LINGO1 suggests that both variants interfere with the glycosylation of the protein. CONCLUSION: LINGO1 is a transmembrane receptor, predominantly found in the central nervous system. Published loss-of-function studies in mouse and zebrafish have established a crucial role of LINGO1 in normal neuronal development and central nervous system myelination by negatively regulating oligodendrocyte differentiation and neuronal survival. Taken together, our results indicate that biallelic LINGO1 missense variants cause autosomal recessive intellectual disability in humans.

Fast, parallel, and cache-friendly suffix array construction.

PURPOSE: String indexes such as the suffix array (SA) and the closely related longest common prefix (LCP) array are fundamental objects in bioinformatics and have a wide variety of applications. Despite their importance in practice, few scalable parallel algorithms for constructing these are known, and the existing algorithms can be highly non-trivial to implement and parallelize. METHODS: In this paper we present CAPS-SA, a simple and scalable parallel algorithm for constructing these string indexes inspired by samplesort and utilizing an LCP-informed mergesort. Due to its design, CAPS-SA has excellent memory-locality and thus incurs fewer cache misses and achieves strong performance on modern multicore systems with deep cache hierarchies. RESULTS: We show that despite its simple design, CAPS-SA outperforms existing state-of-the-art parallel SA and LCP-array construction algorithms on modern hardware. Finally, motivated by applications in modern aligners where the query strings have bounded lengths, we introduce the notion of a bounded-context SA and show that CAPS-SA can easily be extended to exploit this structure to obtain further speedups. We make our code publicly available at https://github.com/jamshed/CaPS-SA .

Fulgor: a fast and compact k-mer index for large-scale matching and color queries.

The problem of sequence identification or matching-determining the subset of reference sequences from a given collection that are likely to contain a short, queried nucleotide sequence-is relevant for many important tasks in Computational Biology, such as metagenomics and pangenome analysis. Due to the complex nature of such analyses and the large scale of the reference collections a resource-efficient solution to this problem is of utmost importance. This poses the threefold challenge of representing the reference collection with a data structure that is efficient to query, has light memory usage, and scales well to large collections. To solve this problem, we describe an efficient colored de Bruijn graph index, arising as the combination of a k-mer dictionary with a compressed inverted index. The proposed index takes full advantage of the fact that unitigs in the colored compacted de Bruijn graph are monochromatic (i.e., all k-mers in a unitig have the same set of references of origin, or color). Specifically, the unitigs are kept in the dictionary in color order, thereby allowing for the encoding of the map from k-mers to their colors in as little as 1 + o(1) bits per unitig. Hence, one color per unitig is stored in the index with almost no space/time overhead. By combining this property with simple but effective compression methods for integer lists, the index achieves very small space. We implement these methods in a tool called Fulgor, and conduct an extensive experimental analysis to demonstrate the improvement of our tool over previous solutions. For example, compared to Themisto-the strongest competitor in terms of index space vs. query time trade-off-Fulgor requires significantly less space (up to 43% less space for a collection of 150,000 Salmonella enterica genomes), is at least twice as fast for color queries, and is 2-6[Formula: see text] faster to construct.

Fulgor: A fast and compact k-mer index for large-scale matching and color queries.

The problem of sequence identification or matching - determining the subset of references from a given collection that are likely to contain a query nucleotide sequence - is relevant for many important tasks in Computational Biology, such as metagenomics and pan-genome analysis. Due to the complex nature of such analyses and the large scale of the reference collections a resourceefficient solution to this problem is of utmost importance. The reference collection should therefore be pre-processed into an index for fast queries. This poses the threefold challenge of designing an index that is efficient to query, has light memory usage, and scales well to large collections. To solve this problem, we describe how recent advancements in associative, order-preserving, k-mer dictionaries can be combined with a compressed inverted index to implement a fast and compact colored de Bruijn graph data structure. This index takes full advantage of the fact that unitigs in the colored de Bruijn graph are monochromatic (all k-mers in a unitig have the same set of references of origin, or "color"), leveraging the order-preserving property of its dictionary. In fact, k-mers are kept in unitig order by the dictionary, thereby allowing for the encoding of the map from k-mers to their inverted lists in as little as 1+o(1) bits per unitig. Hence, one inverted list per unitig is stored in the index with almost no space/time overhead. By combining this property with simple but effective compression methods for inverted lists, the index achieves very small space. We implement these methods in a tool called Fulgor. Compared to Themisto, the prior state of the art, Fulgor indexes a heterogeneous collection of 30,691 bacterial genomes in 3.8× less space, a collection of 150,000 Salmonella enterica genomes in approximately 2× less space, is at least twice as fast for color queries, and is 2 - 6× faster to construct.

Scalable, ultra-fast, and low-memory construction of compacted de Bruijn graphs with Cuttlefish 2.

The de Bruijn graph is a key data structure in modern computational genomics, and construction of its compacted variant resides upstream of many genomic analyses. As the quantity of genomic data grows rapidly, this often forms a computational bottleneck. We present Cuttlefish 2, significantly advancing the state-of-the-art for this problem. On a commodity server, it reduces the graph construction time for 661K bacterial genomes, of size 2.58Tbp, from 4.5 days to 17-23 h; and it constructs the graph for 1.52Tbp white spruce reads in approximately 10 h, while the closest competitor requires 54-58 h, using considerably more memory.

Mass drug administration in Central Equatoria, South Sudan: results and suggestions for future distributions.

Background: South Sudan has rolled out a neglected tropical disease programme, which envisaged deworming campaigns in states endemic for soil transmitted helminth infections and schistosomiasis. Methods: In 2016, two deworming campaigns targeting school-age children were performed in Central Equatoria. Distribution sites were set up in primary schools, Boma Health Initiative headquarters, health centres and markets. Training, radio adverts and community meetings were performed before the campaigns. Results and Conclusions: Central Equatoria implemented the first helminth infections and schistosomiasis treatment campaign, achieving a satisfactory programme coverage (>90%). Setting up drug distribution sites and engaging the Boma Health Initiative are recommended approaches for future campaigns.

Lactic acidemia associated with metformin.

OBJECTIVE: To report 2 cases of lactic acidemia associated with the use of metformin in patients with normal renal function. CASE SUMMARY: An 82-year-old African American man and a 76-year-old white man developed an elevated serum lactic acid concentration a few weeks after initiation of metformin therapy for type 2 diabetes. After the patients discontinued metformin, the serum lactic acid concentration normalized in both cases. An objective causality assessment revealed that the adverse drug event was probably related to the use of metformin. DISCUSSION: Metformin interferes with the production and elimination of lactic acid by a variety of mechanisms that are not well understood. Few systematic data are available on changes in plasma lactic acid concentrations in patients with type 2 diabetes and normal renal function. Clinical significance of a high serum lactic acid concentration needs clarification. CONCLUSIONS: Metformin therapy can be associated with subclinical elevation of lactic acid concentration in the absence of renal insufficiency or other contraindications to using this agent in patients with type 2 diabetes. Periodic monitoring of basic metabolic panels may prevent this potentially serious complication of metformin therapy.