Search bioRxiv⌕ Search

Biology subjects

Kockan, C.

Publications and source records attributed to Kockan, C..

5 recordsLinked to original sources

Accurate strand-specific long-read transcript isoform discovery and quantification at bulk, single-cell, and single-nucleus resolution

Recent advances in long-read transcriptome sequencing enable high-throughput profiling of full-length RNA isoforms in bulk, single-cell, and single-nucleus samples. However, long-read datasets typically contain a mixture of complete and partial transcripts, leading to pervasive ambiguity in read-to-isoform assignment and complicating accurate isoform identification and quantification, particularly in the absence of reliable reference annotations. These challenges are further amplified in single-cell and single-nucleus samples, where coverage is sparse and transcriptional heterogeneity is high. Here, we present the Long Read Alignment Assembler (LRAA), a unified and versatile computational framework for isoform identification and quantification from long-read RNA sequencing data across bulk, single-cell, and single-nucleus transcriptomic samples. LRAA combines splice-graph based structural modeling with expectation maximization based optimization to probabilistically resolve ambiguous read assignments and improve isoform abundance estimation. The framework supports quantification-only, reference-guided, and fully reference-free (de novo) modes of analysis within a single methodological paradigm. We benchmarked LRAA using both simulated and genuine long-read datasets spanning sequencing standards and whole transcriptomes. Central to this evaluation is a novel benchmarking strategy based on Multiplexed Overexpression of Regulatory Factors (MORFs), which provides biologically expressed, barcoded isoforms with unambiguous read-level ground truth. Across all benchmarks, including MORFs, synthetic spike-ins, and whole-transcriptome datasets, LRAA consistently outperformed state-of-the-art methods in isoform identification accuracy, sensitivity, and expression quantification. Finally, we demonstrate the biological utility of LRAA by resolving cell-type-specific isoform usage across peripheral blood immune cell populations and by detecting a pathogenic cryptic isoform of STMN2 with associated transcriptional changes in single-nucleus RNA-seq data from frontal cortex tissue of an individual with frontotemporal dementia (FTD). Together, these results establish LRAA as a robust and general solution for resolving transcript diversity in complex biological systems, from development to disease.

bioinformatics↗

Learning-Augmented Sketching Offers Improved Performance for Privacy Preserving and Secure GWAS

The introduction of trusted execution environments (TEEs), such as secure enclaves provided by the Intel SGX technology has enabled secure and privacy-preserving computation on the cloud. The stringent resource limitations, such as memory constraints, required by some TEEs necessitates the development of computational approaches with reduced memory usage, such as sketching. One example is the SkSES method for GWAS on a cohort of case and control samples from multiple institutions, which identifies the most significant SNPs in a privacy-preserving manner without disclosing sensitive genotype information to other institutions or the cloud service provider. Here we show how to improve the performance of SkSES on large datasets by augmenting it with a learning-augmented approach. Specifically, we show how individual institutions can perform smaller scale GWAS on their own datasets and identify two sets of variants according to certain criteria, which are then used to guide the sketching process to more accurately identify significant variants over the collective dataset. The new method achieves up to 40% accuracy gain compared to the original SkSES method under the same memory constraints on datasets we tested on. The code is available at https://github.com/alreadydone/sgx-genome-variants-search. Contactcenk.sahinalp@nih.gov

bioinformatics↗

Homomorphic Encryption: An Application to Polygenic Risk Scores

1BackgroundPolygenic risk scores (PRSs) have emerged as a powerful tool in precision medicine, enabling personalized risk assessments for complex diseases. However, the use of sensitive genomic data in PRS calculations raises concerns about privacy and security. Fully homomorphic encryption (FHE) offers a promising solution by allowing computations on encrypted data, preserving the privacy of both genomic information and PRS models. MethodsHere, we present an application of FHE for encrypted PRS calculations using a particular protocol (CKKS) within the Lattigo library. Our approach involves a three-party system: clients (clinicians handling sensitive genetic data), modelers developing a PRS (academics or companies), and evaluators (a local hospital running the models while maintaining data confidentiality). We demonstrate the feasibility and accuracy of our approach by applying it to synthetic datasets of various sizes and to a robust 110k-single-nucleotide polymorphism (SNP) model for schizophrenia. The complete codebase and a sample dataset are available at https://github.com/gersteinlab/HEPRS. ResultsThe difference between traditional plaintext and encrypted PRS calculation results is negligible: the R2 is 0.999 and the mean squared error is 2.27 x 10-6. Moreover, while the encrypted calculation is roughly 1,000 times slower than conventional non-encrypted ones (when considering only the core PRS calculation), the computation remains feasible on a single-CPU node. For example, processing [~]1,100 individuals with [~]110k SNPs took six minutes and [~]65 GB of memory on a laptop computer. In addition, we investigated the impact of the encryption parameters on the computational time and accuracy in detail, showing the expected slowdown with higher security settings. ConclusionOur approach showcases the applicability and feasibility of using FHE on real-world PRS models. With the pressing need for privacy-preserving solutions in the era of precision medicine, our work serves as a pilot application, offering a simple use case and providing a detailed comparison and evaluation in terms of accuracy, cost, and scalability.

bioinformatics↗

Privacy-Preserving Genotype Imputation in a Trusted Execution Environment

Genotype imputation is an essential tool in genetics research, whereby missing genotypes are inferred based on a panel of reference genomes to enhance the power of downstream analyses. Recently, public imputation servers have been developed to allow researchers to leverage increasingly large-scale and diverse genetic data repositories for imputation. However, privacy concerns associated with uploading ones genetic data to a third-party server greatly limit the utility of these services. In this paper, we introduce a practical, secure hardware-based solution for a privacy-preserving imputation service, which keeps the input genomes private from the service provider by processing the data only within a Trusted Execution Environment (TEE) offered by the Intel SGX technology. Our solution features SMac, an efficient, side-channel-resilient imputation algorithm designed for Intel SGX, which employs the hidden Markov model (HMM)-based imputation strategy also utilized by a state-of-the-art imputation software Minimac. SMac achieves imputation accuracies virtually identical to those of Minimac and provides protection against known attacks on SGX while maintaining scalability to large datasets. We additionally show the necessity of our strategies for mitigating side-channel risks by identifying vulnerabilities in existing imputation software and controlling their information exposure. Overall, our work provides a guideline for practical and secure implementation of genetic analysis tools in SGX, representing a step toward privacy-preserving analysis services that can facilitate data sharing and accelerate genetics research.{dagger} AvailabilityOur software is available at https://github.com/ndokmai/sgx-genotype-imputation.

bioinformatics↗

Sketching Algorithms for Genomic Data Analysis and Querying in a Secure Enclave

Current practices in collaborative genomic data analysis (e.g. PCAWG [1]) necessitate all involved parties to exchange individual patient data and perform all analysis locally, or use a trusted server for maintaining all data to perform analysis in a single site (e.g. the Cancer Genome Collaboratory). Since both approaches involve sharing genomic sequence data - which is typically not feasible due to privacy issues, collaborative data analysis remains to be a rarity in genomic medicine.\n\nIn order to facilitate efficient and effective collaborative or remote genomic computation we introduce SkSES (Sketching algorithms for Secure Enclave based genomic data analysiS), a computational framework for performing data analysis and querying on multiple, individually encrypted genomes from several institutions in an untrusted cloud environment. Unlike other techniques for secure/privacy preserving genomic data analysis, which typically rely on sophisticated cryptographic techniques with prohibitively large computational overheads, SkSES utilizes the secure enclaves supported by current generation microprocessor architectures such as Intels SGX. The key conceptual contribution of SkSES is its use of sketching data structures that can fit in the limited memory available in a secure enclave.\n\nWhile streaming/sketching algorithms have been developed for many applications in computer science, their feasibility in genomics has remained largely unexplored. On the other hand, even though privacy and security issues are becoming critical in genomic medicine, available cryptographic techniques based on, e.g. homomorphic encryption or garbled circuits, fail to address the performance demands of this rapidly growing field. The alternative offered by Intels SGX, a combination of hardware and software solutions for secure data analysis, is severely limited by the relatively small size of a secure enclave, a private region of the memory protected from other processes. SkSES addresses this limitation through the use of sketching data structures to support efficient secure and privacy preserving SNP analysis across individually encrypted VCF files from multiple institutions. In particular SkSES provides the users the ability to query for the \"k most significant SNPs\" among any set of user specified SNPs and any value of k - even when the total number of SNPs to be maintained is far beyond the memory capacity of the secure enclave.\n\nResultsWe tested SkSES on the complete iDASH-2017 competition data set comprised of 1000 case and 1000 control samples related to an unknown phenotype. SkSES was able to identify the top SNPs with respect to the{chi} 2 statistic, among any user specified subset of SNPs across this data set of 2000 individually encrypted complete human genomes quickly and accurately - demonstrating the feasibility of secure and privacy preserving computation for genomic medicine via Intels SGX.\n\nAvailabilityhttps://github.com/ndokmai/sgx-genome-variants-search

bioinformatics↗