bioRxiv Science⌕ Search

Biology subjects

Hahn, G.

Publications and source records attributed to Hahn, G..

16 recordsLinked to original sources

Analyzing associations and higher-order effects in multi-omics data with double machine learning

MotivationIntegrative omics analyses enhance our understanding of disease mechanisms and biomarkers by investigating relationships among traits, omics measurements, genetic variants, and epidemiological factors. Statistically, these analyses are challenging and require robust, flexible methodologies due to high dimensionality, non-standard data distributions, and potentially complex, non-linear confounding effects. ResultsTo facilitate the integration and analysis of multi-omics data, we introduce the Robust Omics MethodologY (ROMY) framework and its corresponding R implementation, the romy package. ROMY enables users to (a) perform robust association testing between two target variables while incorporating flexible covariate adjustments, (b) examine effects on measurement variances and covariances (e.g., co-expression, co-abundance), and (c) conduct rigorous interaction-effect testing. ROMY builds on recent advances in theoretical statistics and double machine learning to ensure robustness and statistical validity. We illustrate the performance of our framework through simulation studies. Availability and implementationromy is an R package available under the GNU GPLv3 license on GitHub: https://github.com/julianhecker/romy.

bioinformatics↗

Quantification of individual dataset contributions to prediction accuracy in cooperative learning

We consider cooperative learning, a recently proposed technique to leverage the predictive power of several datasets (also called data views) to improve the prediction accuracy of an outcome of interest. Cooperative learning uses a Lasso-type penalty to fit several datasets to a given outcome, while a so-called agreement penalty enforces that the predictions made by the individual datasets agree. We are interested in the question of whether the predictive power of each individual dataset can be quantified using cooperative learning. In this work, we demonstrate that certain trace plots, analogously to the ones for the classic Lasso, allow one to quantify the predictive power of each individual dataset. Importantly, this allows one to detect datasets which do not carry any predictive power on the outcome. In an experimental study, we quantify the predictive power of three real datasets in the context of the Childhood Asthma Management Program (CAMP), with the three datasets containing information on epidemiological variables, metabolites, and clinical data, respectively.

bioinformatics↗

Polygenic hazard score models for the prediction of Alzheimer's free survival using the lasso for Cox's proportional hazards model

The prediction of the susceptibility of an individual to a certain disease is an important and timely research area. An established technique is to estimate the risk of an individual with the help of an integrated risk model, that is a polygenic risk score with added epidemiological covariates. However, integrated risk models do not capture any time dependence, and may provide a point estimate of the relative risk with respect to a reference population. The aim of this work is twofold. First, we explore and advocate the idea of predicting the time dependent hazard and survival (defined as disease free time) of an individual for the onset of a disease. This provides a practitioner with a much more differentiated view of the absolute survival as a function of time. Second, to compute the time dependent risk of an individual, we use published methodology to fit a Coxs proportional hazard model to data from a genetic SNP study of time to Alzheimers disease (AD) onset, using the lasso to incorporate further epidemiological variables such as sex, APOE (apolipoprotein E, a genetic risk factor for AD) status, ten leading principal components, and selected genomic loci. We apply the lasso for Coxs proportional hazards to a dataset of 6792 AD patients (composed of 4102 cases and 2690 controls) and 87 covariates. We demonstrate that fitting a lasso model for Coxs proportional hazards allows one to obtain more accurate survival curves than with state-of-the-art (likelihood-based) methods. Moreover, the methodology allows one to obtain personalized survival curves for a patient, thus giving a much more differentiated view of the expected progression of a disease than the view offered by integrated risk models. The runtime to compute personalized survival curves is under a minute for the entire dataset of AD patients, thus enabling it to handle datasets with 60, 000 to 100, 000 subjects in less than one hour.

bioinformatics↗

Improving forest ecosystem functions by optimizing tree species spatial arrangement

Reforestation and afforestation programs are promoted as strategies to mitigate rising atmospheric CO2 concentrations and enhance ecosystem services. Planting diverse forests is supposed to foster such benefits, but optimal tree planting techniques, especially regarding species spatial arrangement, are underexplored. Here, using field measurements from the subtropical BEF-China experiment, we simulated leaf litterfall and decomposition, as a function of various spatial arrangements of tree species, from clusters of species to random distributions. We show that increasing tree species spatial heterogeneity in forests composed of nine tree species led to more evenly distributed litterfall, increased litter decomposition and associated nitrogen cycling by 45%. These effects were amplified with increasing plot species richness, while species functional trait identity and diversity modulated these relationships. The spatial arrangement of tree species is a critical component determining biodiversity-ecosystem functioning relationships, and considering such spatial aspects is crucial for operationalizing biodiversity-ecosystem functioning theory in realistic re-/afforestation projects.

ecology↗

Fast computation of principal components of genomic similarity matrices

The computation of a similarity measure for genomic data, for instance using the (genomic) covariance matrix, the Jaccard matrix, or the genomic relationship matrix (GRM), is a standard tool in computational genetics. The principal components of such matrices are routinely used to correct for biases in, for instance, linear regressions. However, the calculation of both a similarity matrix and its singular value decomposition (SVD) are computationally intensive. The contribution of this article is threefold. First, we demonstrate that the calculation of three matrices (the genomic covariance matrix, the weighted Jaccard matrix, and the genomic relationship matrix) can be reformulated in a unified way which allows for an exact, faster SVD computation. An exception is the Jaccard matrix, which does not have a structure applicable for the fast SVD computation. An exact algorithm is proposed to compute the principal components of the genomic covariance, weighted Jaccard, and genomic relationship matrices. The algorithm is adapted from an existing randomized SVD algorithm and ensures that all computations are carried out in sparse matrix algebra. Second, an approximate Jaccard matrix is introduced to which the fast SVD computation is applicable. Third, we establish guaranteed theoretical bounds on the distance (in L2 norm and angle) between the principal components of the Jaccard matrix and the ones of our proposed approximation, thus putting the proposed Jaccard approximation on a solid mathematical foundation. We illustrate all computations on both simulated data and data of the 1000 Genome Project, showing that the approximation error is very low in practice.

bioinformatics↗

Unsupervised outlier detection applied to SARS-CoV-2 nucleotide sequences can identify sequences of common variants and other variants of interest

As of June 2022, the GISAID database contains more than one million SARS-CoV-2 genomes, including several thousand nucleotide sequences for the most common variants such as delta or omicron. These SARS-CoV-2 strains have been collected from patients around the world since the beginning of the pandemic. We start by assessing the similarity of all pairs of nucleotide sequences using the Jaccard index and principal component analysis. As shown previously in the literature, an unsupervised cluster analysis applied to the SARS-CoV-2 genomes results in clusters of sequences according to certain characteristics such as their strain or their clade. Importantly, we observe that nucleotide sequences of common variants are often outliers in clusters of sequences stemming from variants identified earlier on during the pandemic. Motivated by this finding, we are interested in applying outlier detection to nucleotide sequences. We demonstrate that nucleotide sequences of common variants (such as alpha, delta, or omicron) can be identified solely based on a statistical outlier criterion. We argue that outlier detection might be a useful surveillance tool to identify emerging variants in real time as the pandemic progresses.

bioinformatics↗

Unsupervised genome-wide cluster analysis: nucleotide sequences of the omicron variant of SARS-CoV-2 are similar to sequences from early 2020

The GISAID database contains more than 1,000,000 SARS-CoV-2 genomes, including sequences of the recently discovered SARS-CoV-2 omicron variant and of prior SARS-CoV-2 strains that have been collected from patients around the world since the beginning of the pandemic. We applied unsupervised cluster analysis to the SARS-CoV-2 genomes, assessing their similarity at a genome-wide level based on the Jaccard index and principal component analysis. Our analysis results show that the omicron variant sequences are most similar to sequences that have been submitted early in the pandemic around January 2020. Furthermore, the omicron variants in GISAID are spread across the entire range of the first principal component, suggesting that the strain has been in circulation for some time. This observation supports a long-term infection hypothesis as the omicron strain origin.

bioinformatics↗

A smoothed version of the Lassosum penalty for fitting integrated risk models

Polygenic risk scores are a popular means to predict the disease risk or disease susceptibility of an individual based on its genotype information. When adding other important epidemiological covariates such as age or sex, we speak of an integrated risk model. Methodological advances for fitting more accurate integrated risk models are of immediate importance to improve the precision of risk prediction, thereby potentially identifying patients at high risk early on when they are still able to benefit from preventive steps/interventions targeted at increasing their odds of survival, or at reducing their chance of getting a disease in the first place. This article proposes a smoothed version of the "Lassosum" penalty used to fit polygenic risk scores and integrated risk models. The smoothing allows one to obtain explicit gradients everywhere for efficient minimization of the Lassosum objective function while guaranteeing bounds on the accuracy of the fit. An experimental section on both Alzheimers disease and COPD (chronic obstructive pulmonary disease) demonstrates the increased accuracy of the proposed smoothed Lassosum penalty compared to the original Lassosum algorithm, allowing it to draw equal with state-of-the-art methodology such as LDpred2 when evaluated via the AUC (area under the ROC curve) metric.

bioinformatics↗

Mutations in SARS-CoV-2 spike protein and RNA polymerase complex are associated with COVID-19 mortality risk

BackgroundSARS-CoV-2 mortality has been extensively studied in relation to host susceptibility. How sequence variations in the SARS-CoV-2 genome affect pathogenicity is poorly understood. Whole-genome sequencing (WGS) of the virus with death in SARS-CoV-2 patients is one potential method of early identification of highly pathogenic strains to target for containment. MethodsWe analyzed 7,548 single stranded RNA-genomes of SARS-CoV-2 patients in the GISAID database (Elbe and Buckland-Merrett, 2017; Shu and McCauley, 2017) and associated variants with reported patients health status from COVID-19, i.e. deceased versus non-deceased. We probed each locus of the single stranded RNA of the SARS-CoV-2 virus for direct association with host/patient mortality using a logistic regression. ResultsIn total, evaluating 29,891 loci of the viral genome for association with patient/host mortality, two loci, at 12,053bp and 25,088bp, achieved genome-wide significance (p-values of 4.09e-09 and 4.41e-23, respectively). ConclusionsMutations at 25,088bp occur in the S2 subunit of the SARS-CoV-2 spike protein, which plays a key role in viral entry of target host cells. Additionally, mutations at 12,053bp are within the ORF1ab gene, in a region encoding for the protein nsp7, which is necessary to form the RNA polymerase complex responsible for viral replication and transcription. Both mutations altered amino acid coding sequences, potentially imposing structural changes that could enhance viral infectivity and symptom severity, and may be important to consider as targets for therapeutic development. Identification of these highly significant associations, unlikely to occur by chance, may assist with COVID-19 early containment of strains that are potentially highly pathogenic.

genomics↗

A framework to efficiently smooth L1 penalties for linear regression

Penalized linear regression approaches that include an L1 term have become an important tool in statistical data analysis. One prominent example is the least absolute shrinkage and selection operator (Lasso), though the class of L1 penalized regression operators also includes the fused and graphical Lasso, the elastic net, etc. Although the L1 penalty makes their objective function convex, it is not differentiable everywhere, motivating the development of proximal gradient algorithms such as Fista, the current gold standard in the literature. In this work, we take a different approach based on smoothing in a fixed parameter setting (the problem size n and number of parameters p are fixed). The methodological contribution of our article is threefold: (1) We introduce a unified framework to compute closed-form smooth surrogates of a whole class of L1 penalized regression problems using Nesterov smoothing. The surrogates preserve the convexity of the original (unsmoothed) objective functions, are uniformly close to them, and have closed-form derivatives everywhere for efficient minimization via gradient descent; (2) We prove that the estimates obtained with the smooth surrogates can be made arbitrarily close to the ones of the original (unsmoothed) objective functions, and provide explicitly computable a priori error bounds on the accuracy of our estimates; (3) We propose an iterative algorithm to progressively smooth the L1 penalty which increases accuracy and is virtually free of tuning parameters. The proposed methodology is applicable to a large class of L1 penalized regression operators, including all the operators mentioned above. Although the resulting estimates are typically dense, sparseness can be enforced again via thresholding. Using simulation studies, we compare our framework to current gold standards such as Fista, glmnet, gLasso, etc. Our results suggest that our proposed smoothing framework provides predictions of equal or higher accuracy than the gold standards while keeping the aforementioned theoretical guarantees and having roughly the same asymptotic runtime scaling.

bioinformatics↗

Computational Properties of the Visual Microcircuit

The neocortex is organized around layered microcircuits consisting of a variety of excitatory and inhibitory neuronal types which perform rate-and oscillation based computations. Using modeling, we show that both superficial and deep layers of the primary mouse visual cortex implement two ultrasensitive and bistable switches built on mutual inhibitory connectivity motives between SST, PV and VIP cells. The switches toggle pyramidal neurons between high and low firing rate states that are synchronized across layers through translaminar connectivity. Moreover, inhibited and disinhibited states are characterized by low- and high frequency oscillations, respectively, with layer-specific differences in frequency and power which show asymmetric changes during state transitions. These findings are consistent with a number of experimental observations and embed firing rate together with oscillatory changes within a switch interpretation of the microcircuit.

neuroscience↗

Unsupervised cluster analysis of SARS-CoV-2 genomes indicates that recent (June 2020) cases in Beijing are from a genetic subgroup that consists of mostly European and South(east) Asian samples, of which the latter are the most recent

Research efforts of the ongoing SARS-CoV-2 pandemic have focused on viral genome sequence analysis to understand how the virus spread across the globe. Here, we assess three recently identified SARS-CoV-2 genomes in Beijing from June 2020 and attempt to determine the origin of these genomes, made available in the GISAID database. The database contains fully or partially sequenced SARS-CoV-2 samples from laboratories around the world. Including the three new samples and excluding samples with missing annotations, we analyzed 7, 643 SARS-CoV-2 genomes. Using principal component analysis computed on a similarity matrix that compares all pairs of the SARS-CoV-2 nucleotide sequences at all loci simultaneously, using the Jaccard index, we find that the newly discovered virus genomes from Beijing are in a genetic cluster that consists mostly of cases from Europe and South(east) Asia. The sequences of the new cases are most related to virus genomes from a small number of cases from China (March 2020), cases from Europe (February to early May 2020), and cases from South(east) Asia (May to June 2020). These findings could suggest that the original cases of this genetic cluster originated from China in March 2020 and were re-introduced to China by transmissions from samples from South(east) Asia between April and June 2020.

bioinformatics↗

Unsupervised cluster analysis of SARS-CoV-2 genomes reflects its geographic progression and identifies distinct genetic subgroups of SARS-CoV-2 virus

Over 10,000 viral genome sequences of the SARS-CoV-2 virus have been made readily available during the ongoing coronavirus pandemic since the initial genome sequence of the virus was released on the open access Virological website (http://virological.org/) early on January 11. We utilize the published data on the single stranded RNAs of 11, 132 SARS-CoV-2 patients in the GISAID (Elbe and Buckland-Merrett, 2017; Shu and McCauley, 2017) database, which contains fully or partially sequenced SARS-CoV-2 samples from laboratories around the world. Among many important research questions which are currently being investigated, one aspect pertains to the genetic characterization/classification of the virus. We analyze data on the nucleotide sequencing of the virus and geographic information of a subset of 7, 640 SARS-CoV-2 patients without missing entries that are available in the GISAID database. Instead of modelling the mutation rate, applying phylogenetic tree approaches, etc., we here utilize a model-free clustering approach that compares the viruses at a genome-wide level. We apply principal component analysis to a similarity matrix that compares all pairs of these SARS-CoV-2 nucleotide sequences at all loci simultaneously, using the Jaccard index (Jaccard, 1901; Tan et al., 2005; Prokopenko et al., 2016; Schlauch et al., 2017). Our analysis results of the SARS-CoV-2 genome data illustrates the geographic and chronological progression of the virus, starting from the first cases that were observed in China to the current wave of cases in Europe and North America. This is in line with a phylogenetic analysis which we use to contrast our results. We also observe that, based on their sequence data, the SARS-CoV-2 viruses cluster in distinct genetic subgroups. It is the subject of ongoing research to examine whether the genetic subgroup could be related to diseases outcome and its potential implications for vaccine development.

genomics↗

Ephaptic coupling in white matter fibre bundles modulates axonal transmission delays

Axonal connections are widely regarded as faithful transmitters of neuronal signals with fixed delays. The reasoning behind this is that extra-cellular potentials caused by spikes travelling along axons are too small to have an effect on other axons. Here we devise a computational framework that allows us to study the effect of extracellular potentials generated by spike volleys in axonal fibre bundles on axonal transmission delays. We demonstrate that, although the extracellular potentials generated by single spikes are of the order of microvolts, the collective extracellular potential generated by spike volleys can reach several millivolts. As a consequence, the resulting depolarisation of the axonal membranes increases the velocity of spikes, and therefore reduces axonal delays between brain areas. Driving a neural mass model with such spike volleys, we further demonstrate that only ephaptic coupling can explain the reduction of stimulus latencies with increased stimulus intensities, as observed in many psychological experiments. Author summaryAxonal fibre bundles that connect distant cortical areas contain millions of densely packed axons. When synchronous spike volleys travel through such fibre bundles, the extracellular potential within the bundles is perturbed. We use computer simulations to examine the magnitude and shape of this perturbation, and demonstrate that it is sufficiently strong to affect axonal transmission speeds. Since most spikes within a spike volley are positioned in an area where the extracellular potential is negative (relative to a distant reference), the resulting depolarisation of the axonal membranes accelerates the spike volley on average. This finding is in contrast to previous studies of ephaptic coupling effects between axons, where ephaptic coupling was found to slow down spike propagation. Our finding has consequences for information transmission and synchronisation between cortical areas.

neuroscience↗

A fast and efficient smoothing approach to LASSO regression and an application in statistical genetics: polygenic risk scores for Chronic obstructive pulmonary disease (COPD)

High dimensional linear regression problems are often fitted using Lasso approaches. Although the Lasso objective function is convex, it is not differentiable everywhere, making the use of gradient descent methods for minimization not straightforward. To avoid this technical issue, we apply Nesterov smoothing to the original (unsmoothed) Lasso objective function. We introduce a closed-form smoothed Lasso which preserves the convexity of the Lasso function, is uniformly close to the unsmoothed Lasso, and allows us to obtain closed-form derivatives everywhere for efficient and fast minimization via gradient descent. Our simulation studies are focused on polygenic risk scores using genetic data from a genome-wide association study (GWAS) for chronic obstructive pulmonary disease (COPD). We compare accuracy and run-time of our approach to the current gold standard in the literature, the FISTA algorithm. Our results suggest that the proposed methodology provides estimates with equal or higher accuracy than the FISTA algorithm while having the same asymptotic runtime scaling. The proposed methodology is implemented in the R-package smoothedLasso, available on the Comprehensive R Archive Network (CRAN).

bioinformatics↗

locStra: Fast analysis of regional/global stratification in whole genome sequencing (WGS) studies

locStra is an R-package for the analysis of regional and global population stratification in whole genome sequencing studies, where regional stratification refers to the substructure defined by the loci in a particular region on the genome. Population substructure can be assessed based on the genetic covariance matrix, the genomic relationship matrix, and the unweighted/weighted genetic Jaccard similarity matrix. Using a sliding window approach, the regional similarity matrices are compared to the global ones, based on user-defined window sizes and metrics, e.g. the correlation between regional and global eigenvectors. An algorithm for the specification of the window size is provided. As the implementation fully exploits sparse matrix algebra and is written in C++, the analysis is highly efficient. Even on single cores, for realistic study sizes (several thousand subjects, several million RVs per subject), the runtime for the genome-wide computation of all regional similarity matrices does typically not exceed one hour, enabling an unprecedented investigation of regional stratification across the entire genome. The package is applied to three WGS studies, illustrating the varying patterns of regional substructure across the genome and its beneficial effects on association testing.

genetics↗