bioRxiv Science⌕ Search

Biology subjects

Noble, W. S.

Publications and source records attributed to Noble, W. S..

At least 109 records · Page 6Linked to original sources

Ledidi: Designing genome edits that induce functional activity

The development of modern genome editing tools has enabled researchers to make edits with high precision, but has left unsolved the problem of designing these edits. We propose Ledidi, an approach that treats the design of genomic edits as an optimization problem where the goal is to produce the desired output from a predictive model. The discrete nature of biological sequences makes direct optimization challenging, but we overcome this by using the Gumbel-Softmax reparameterization trick. We validate Ledidi by pairing it with the Basenji model, which makes predictions for thousands of functional profiles, and designing edits that affect CTCF binding and induce cell type-specific binding of JUND.

bioinformatics↗

Submodular sketches of single-cell RNA-seq measurements

Analyzing and sharing massive single-cell RNA-seq data sets can be facilitated by creating a "sketch" of the data--a selected subset of cells that accurately represent the full data set. Using an existing benchmark, we demonstrate the utility of submodular optimization in efficiently creating high quality sketches of scRNA-seq data.

bioinformatics↗

Gromov-Wasserstein optimal transport to align single-cell multi-omics data

Data integration of single-cell measurements is critical for understanding cell development and disease, but the lack of correspondence between different types of measurements makes such efforts challenging. Several unsupervised algorithms can align heterogeneous single-cell measurements in a shared space, enabling the creation of mappings between single cells in different data domains. However, these algorithms require hyperparameter tuning for high-quality alignments, which is difficult in an unsupervised setting without correspondence information for validation. We present Single-Cell alignment using Optimal Transport (SCOT), an unsupervised learning algorithm that uses Gromov Wasserstein-based optimal transport to align single-cell multi-omics datasets. We compare the alignment performance of SCOT with state-of-the-art algorithms on four simulated and two real-world datasets. SCOT performs on par with state-of-the-art methods but is faster and requires tuning fewer hyperparameters. Furthermore, we provide an algorithm for SCOT to use Gromov Wasserstein distance to guide the parameter selection. Thus, unlike previous methods, SCOT aligns well without using any orthogonal correspondence information to pick the hyperparameters. Our source code and scripts for replicating the results are available at https://github.com/rsinghlab/SCOT.

bioinformatics↗

A high-throughput screen for transcription activation domains reveals their sequence characteristics and permits reliable prediction by deep learning

Transcription activation domains (ADs) are encoded by a wide range of seemingly unrelated amino acid sequences, making it difficult to recognize features that permit their dynamic behavior, fuzzy interactions and target specificity. We screened a large set of random 30-mer peptides for AD function and trained a deep neural network (ADpred) on the AD-positive and negative sequences. ADpred correctly identifies known ADs within protein sequences and accurately predicts the consequences of mutations. We show that functional ADs are (1) located within intrinsically disordered regions with biased amino acid composition, (2) contain clusters of hydrophobic residues near acidic side chains, (3) are enriched or depleted for particular dipeptide sequences, and (4) have higher helical propensity than surrounding regions. Taken together, our findings fit the model of "fuzzy" binding through hydrophobic protein-protein interfaces, where activator-coactivator binding takes place in a dynamic hydrophobic environment rather than through combinations of sequence-specific interactions.

molecular biology↗

A machine learning strategy that leverages large datasets to boost statistical power in small-scale experiments

Machine learning methods have proven invaluable for increasing the sensitivity of peptide detection in proteomics experiments. Most modern tools, such as Percolator and PeptideProphet, use semi-supervised algorithms to learn models directly from the datasets that they analyze. Although these methods are effective for many proteomics experiments, we suspected that they may be suboptimal for experiments of smaller scale. In this work, we found that the power and consistency of Percolator results was reduced as the size of the experiment was decreased. As an alternative, we propose a different operating mode for Percolator: learn a model with Per-colator from a large dataset and use the learned model to evaluate the small-scale experiment. We call this a "static modeling" approach, in contrast to Percolators usual "dynamic model" that is trained anew for each dataset. We applied this static modeling approach to two settings: small, gel-based experiments and single-cell proteomics. In both cases, static models increased the yield of detected peptides and eliminated the model-induced variability of the standard dynamic approach. These results suggest that static models are a powerful tool for bringing the full benefits of Percolator and other semi-supervised algorithms to small-scale experiments. O_FIG O_LINKSMALLFIG WIDTH=200 HEIGHT=106 SRC="FIGDIR/small/849331v1_ufig1.gif" ALT="Figure 1"> View larger version (20K): org.highwire.dtl.DTLVardef@9be517org.highwire.dtl.DTLVardef@dd6e3eorg.highwire.dtl.DTLVardef@170e35corg.highwire.dtl.DTLVardef@5ec13e_HPS_FORMAT_FIGEXP M_FIG C_FIG

bioinformatics↗

Zero-shot imputations across species are enabled through joint modeling of human and mouse epigenomics

Recent large-scale efforts to characterize functional activity in human have produced thousands of genome-wide experiments that quantify various forms of biochemistry, such as histone modifications, protein binding, transcription, and chromatin accessibility. Although these experiments represent a small fraction of the possible experiments that could be performed, they also make human more comprehensively characterized than any other species. We propose an extension to the imputation approach Avocado that enables the model to leverage genome alignments and the large number of human genomics data sets when making imputations in other species. We found that not only does this extension result in improved imputation of mouse functional experiments, but that the extended model is able to make accurate imputations for protein binding assays that have been performed in human but not in mouse. This ability to make "zero-shot" imputations greatly increases the utility of such imputation approaches and enables comprehensive imputations to be made for species even when experimental data are sparse. CCS CONCEPTS* Computing methodologies [->] Neural networks; Factorization methods; * Applied computing [->] Bioinformatics; Genomics. ACM Reference FormatJacob Schreiber, Deepthi Hegde, and William Noble. 2020. Zero-shot imputations across species are enabled through joint modeling of human and mouse epigenomics. In ACM-BCB 2020: 11th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics, Sept 21-24, 2020, Virtual. ACM, New York, NY, USA, 9 pages. https://doi.org/10.1145/1122445.1122456

bioinformatics↗

Matrix-matched calibration curves for assessing analytical figures of merit in quantitative proteomics

Mass spectrometry is a powerful tool for quantifying protein abundance in complex samples. Advances in sample preparation and the development of data independent acquisition (DIA) mass spectrometry approaches have increased the number of peptides and proteins measured per sample. Here we present a series of experiments demonstrating how to assess whether a peptide measurement is quantitative by mass spectrometry. Our results demonstrate that increasing the number of detected peptides in a proteomics experiment does not necessarily result in increased numbers of peptides that can be measured quantitatively.

biochemistry↗

Prioritizing transcriptomic and epigenomic experiments by using an optimization strategy that leverages imputed data

Successful science often involves not only performing experiments well, but also choosing well among many possible experiments. In a hypothesis generation setting, choosing an experiment well means choosing an experiment whose results are interesting or novel. In this work, we formalize this selection procedure in the context of genomics and epigenomics data generation. Specifically, we consider the task faced by a scientific consortium such as the National Institutes of Health ENCODE Consortium, whose goal is to characterize all of the functional elements in the human genome. Given a list of possible cell types or tissue types (\"biosamples\") and a list of possible high throughput sequencing assays, we ask \"Which experiments should ENCODE perform next?\" We demonstrate how to represent this task as an optimization problem, where the goal is to maximize the information gained in each successive experiment. Compared with previous work that has addressed a similar problem, our approach has the advantage that it can use imputed data to tailor the selected list of experiments based on data collected previously by the consortium. We demonstrate the utility of our proposed method in simulations, and we provide a general software framework, named Kiwano, for selecting genomic and epigenomic experiments.

genomics↗

Trans- and cis-acting effects of the lncRNA Firre on epigenetic and structural features of the inactive X chromosome

Firre encodes a lncRNA involved in nuclear organization in mammals. Here we find that Firre RNA is transcribed from the active X chromosome (Xa) and exerts trans-acting effects on the inactive X chromosome (Xi). Allelic deletion of Firre on the Xa in a mouse hybrid fibroblast cell line results in a dramatic loss of the histone modification H3K27me3 and of components of the PRC2 complex on the Xi as well as the disruption of the perinucleolar location of the Xi. These features are measurably rescued by ectopic expression of a mouse or human Firre/FIRRE cDNA transgene, strongly supporting a conserved trans-acting role of the Firre transcript in maintaining the Xi heterochromatin environment. Surprisingly, CTCF occupancy is decreased on the Xi upon loss of Firre RNA, but is partially recovered by ectopic transgene expression, suggesting a functional link between Firre RNA and CTCF in maintenance of epigenetic features and/or location of the Xi. Loss of Firre RNA results in dysregulation of genes implicated in cell division and development, but not in reactivation of genes on the Xi, which retains its bipartite structure despite some changes in chromatin contact distribution. Allelic deletion or inversion of Firre on the Xi causes localized redistribution of chromatin contacts, apparently dependent on the orientation of CTCF binding sites clustered at the locus. Thus, the Firre locus and its RNA have roles in the maintenance of epigenetic features and structure of the Xi.

genomics↗

Extremely fast and accurate open modification spectral library searching of high-resolution mass spectra using feature hashing and graphics processing units

Open modification searching (OMS) is a powerful search strategy to identify peptides with any type of modification. OMS works by using a very wide precursor mass window to allow modified spectra to match against their unmodified variants, after which the modification types can be inferred from the corresponding precursor mass differences. A disadvantage of this strategy, however, is the large computational cost, because each query spectrum has to be compared against a multitude of candidate peptides.\n\nWe have previously introduced the ANN-SoLo tool for fast and accurate open spectral library searching. ANN-SoLo uses approximate nearest neighbor indexing to speed up OMS by selecting only a limited number of the most relevant library spectra to compare to an unknown query spectrum. Here we demonstrate how this candidate selection procedure can be further optimized using graphics processing units. Additionally, we introduce a feature hashing scheme to convert high-resolution spectra to low-dimensional vectors. Based on these algorithmic advances, along with low-level code optimizations, the new version of ANN-SoLo is up to an order of magnitude faster than its initial version. This makes it possible to efficiently perform open searches on a large scale to gain a deeper understanding about the protein modification landscape. We demonstrate the computational efficiency and identification performance of ANN-SoLo based on a large data set of the draft human proteome.\n\nANN-SoLo is implemented in Python and C++. It is freely available under the Apache 2.0 license at https://github.com/bittremieux/ANN-SoLo.

bioinformatics↗

Sci-Hi-C: a single-cell Hi-C method for mapping 3D genome organization in large number of single cells

The highly dynamic nature of chromosome conformation and three-dimensional (3D) genome organization leads to cell-to-cell variability in chromatin interactions within a cell population, even if the cells of the population appear to be functionally homogeneous. Hence, although Hi-C is a powerful tool for mapping 3D genome organization, this heterogeneity of chromosome higher order structure among individual cells limits the interpretive power of population based bulk Hi-C assays. Moreover, single-cell studies have the potential to enable the identification and characterization of rare cell populations or cell subtypes in a heterogeneous population. However, it may require surveying relatively large numbers of single cells to achieve statistically meaningful observations in single-cell studies. By applying combinatorial cellular indexing to chromosome conformation capture, we developed single-cell combinatorial indexed Hi-C (sci-Hi-C), a high throughput method that enables mapping chromatin interactomes in large number of single cells. We demonstrated the use of sci-Hi-C data to separate cells by karytoypic and cell-cycle state differences and to identify cellular variability in mammalian chromosomal conformation. Here, we provide a detailed description of method design and step-by-step working protocols for sci-Hi-C.

genomics↗

Chromatin compartment dynamics in a haploinsufficient model of cardiac laminopathy

Pathogenic mutations in A-type nuclear lamins cause dilated cardiomyopathy, which is postulated to result from dysregulated gene expression due to changes in chromatin organization into active and inactive compartments. To test this, we performed genome-wide chromosome conformation analyses (Hi-C) in human induced pluripotent stem cell-derived cardiomyocytes (hiPSC-CMs) with a haploinsufficient mutation for lamin A/C. Compared to gene-corrected cells, mutant hiPSC-CMs have marked electrophysiological and contractile alterations, with modest gene expression changes. While large-scale changes in chromosomal topology are evident, differences in chromatin compartmentalization are limited to a few hotspots that escape inactivation during cardiogenesis. These regions exhibit upregulation of multiple non-cardiac genes including CACNA1A, encoding for neuronal P/Q-type calcium channels. Pharmacological inhibition of the resulting current partially mitigates the electrical alterations. On the other hand, A/B compartment changes do not explain most gene expression alterations in mutant hiPSC-CMs. We conclude that global errors in chromosomal compartmentation are not the primary pathogenic mechanism in heart failure due to lamin A/C haploinsufficiency. SummaryBertero et al. observe that lamin A/C haploinsufficiency in human cardiomyocytes markedly alters electrophysiology, contractility, gene expression, and chromosomal topology. Contrary to expectations, however, changes in chromatin compartments involve just few regions, and most dysregulated genes lie outside these hotspots. Condensed titleGenomic effects of lamin A/C haploinsufficiency

genomics↗

Capturing cell type-specific chromatin structural patterns by applying topic modeling to single-cell Hi-C data

Single-cell Hi-C (scHi-C) interrogates genome-wide chromatin interaction in individual cells, allowing us to gain insights into 3D genome organization. However, the extremely sparse nature of scHi-C data poses a significant barrier to analysis, limiting our ability to tease out hidden biological information. In this work, we approach this problem by applying topic modeling to scHi-C data. Topic modeling is well-suited for discovering latent topics in a collection of discrete data. For our analysis, we generate twelve different single-cell combinatorial indexed Hi-C (sciHi-C) libraries from five human cell lines (GM12878, H1Esc, HFF, IMR90, and HAP1), consisting over 25,000 cells. We demonstrate that topic modeling is able to successfully capture cell type differences from sciHi-C data in the form of "chromatin topics." We further show enrichment of particular compartment structures associated with locus pairs in these topics.

genomics↗

A pitfall for machine learning methods aiming to predict across cell types

Machine learning models to predict phenomena such as gene expression, enhancer activity, transcription factor binding, or chromatin conformation are most useful when they can generalize to make accurate predictions across cell types. In this situation, a natural strategy is to train the model on experimental data from some cell types and evaluate performance on one or more held-out cell types. In this work, we show that, when the training set contains examples derived from the same genomic loci across multiple cell types, then the resulting model can be susceptible to a particular form of bias related to memorizing the average activity associated with each genomic locus. Consequently, the trained model may appear to perform well when evaluated on the genomic loci that it was trained on but tends to perform poorly on loci that it was not trained on. We demonstrate this phenomenon by using epigenomic measurements and nucleotide sequence to predict gene expression and chromatin domain boundaries, and we suggest methods to diagnose and avoid the pitfall. We anticipate that, as more data and computing resources become available, future projects will increasingly risk suffering from this issue.

bioinformatics↗

A learned embedding for efficient joint analysis of millions of mass spectra

Computational methods that aim to exploit publicly available mass spectrometry repositories primarily rely on unsupervised clustering of spectra. Here, we propose to train a deep neural network in a supervised fashion based on previous assignments of peptides to spectra. The network, called "GLEAMS," learns to embed spectra into a low-dimensional space in which spectra generated by the same peptide are close to one another. We use GLEAMS as the basis for a large-scale spectrum clustering, detecting groups of unidentified, proximal spectra representing the same peptide, and we show how to use these clusters to explore the dark proteome of repeatedly observed yet consistently unidentified mass spectra. We provide a software implementation of our approach, along with a tool to quickly embed additional spectra using a pre-trained model, to facilitate large-scale analyses.

bioinformatics↗

Massively parallel profiling and predictive modeling of the outcomes of CRISPR/Cas9-mediated double-strand break repair

Non-homologous end-joining (NHEJ) plays an important role in double-strand break (DSB) repair of DNA. Recent studies have shown that the error patterns of NHEJ are strongly biased by sequence context, but these studies were based on relatively few templates. To investigate this more thoroughly, we systematically profiled [~]1.16 million independent mutational events resulting from CRISPR/Cas9-mediated cleavage and NHEJ-mediated DSB repair of 6,872 synthetic target sequences, introduced into a human cell line via lentiviral infection. We find that: 1) insertions are dominated by 1 bp events templated by sequence immediately upstream of the cleavage site, 2) deletions are predominantly associated with microhomology, and 3) targets exhibit variable but reproducible diversity with respect to the number and relative frequency of the mutational outcomes to which they give rise. From these data, we trained a model that uses local sequence context to predict the distribution of mutational outcomes. Exploiting the bias of NHEJ outcomes towards microhomology mediated events, we demonstrate the programming of deletion patterns by introducing microhomology to specific locations in the vicinity of the DSB site. We anticipate that our results will inform investigations of DSB repair mechanisms as well as the design of CRISPR/Cas9 experiments for diverse applications including genome-wide screens, gene therapy, lineage tracing and molecular recording.

genomics↗

MoMo: Discovery of statistically significant post-translational modification motifs

MotivationPost-translational modifications (PTMs) of proteins are associated with many significant biological functions and can be identified in high throughput using tandem mass spectrometry. Many PTMs are associated with short sequence patterns called \"motifs\" that help localize the modifying enzyme. Accordingly, many algorithms have been designed to identify these motifs from mass spectrometry data. Accurate statistical confidence estimates for discovered motifs are critically important for proper interpretation and in the design of downstream experimental validation.\n\nResultsWe describe a method for assigning statistical confidence estimates to PTM motifs, and we demonstrate that this method provides accurate p-values on both simulated and real data. Our methods are implemented in MoMo, a software tool for discovering motifs among sets of PTMs that we make available as a web server and as downloadable source code. MoMo reimplements the two most widely used PTM motif discovery algorithms--motif-x and MoDL--while offering many enhancements. Relative to motif-x, MoMo offers improved statistical confidence estimates and more accurate calculation of motif scores. The MoMo web server offers more proteome databases, more input formats, larger inputs and longer running times than the motif-x web server. Finally, our study demonstrates that the confidence estimates produced by motif-x are inaccurate. This inaccuracy stems in part from the common practice of drawing \"background\" peptides from an unshuffled proteome database. Our results thus suggest that many of the hundreds of papers that use motif-x to find motifs may be reporting results that lack statistical support.\n\nAvailabilityhttp://meme-suite.org\n\nContacttimothybailey@unr.edu

bioinformatics↗

Multi-scale deep tensor factorization learns a latent representation of the human epigenome

The human epigenome has been experimentally characterized by measurements of protein binding, chromatin acessibility, methylation, and histone modification in hundreds of cell types. The result is a huge compendium of data, consisting of thousands of measurements for every basepair in the human genome. These data are difficult to make sense of, not only for humans, but also for computational methods that aim to detect genes and other functional elements, predict gene expression, characterize polymorphisms, etc. To address this challenge, we propose a deep neural network tensor factorization method, Avocado, that compresses epigenomic data into a dense, information-rich representation of the human genome. We use data from the Roadmap Epigenomics Consortium to demonstrate that this learned representation of the genome is broadly useful: first, by imputing epigenomic data more accurately than previous methods, and second, by showing that machine learning models that exploit this representation outperform those trained directly on epigenomic data on a variety of genomics tasks. These tasks include predicting gene expression, promoter-enhancer interactions, replication timing, and an element of 3D chromatin architecture. Our findings suggest the broad utility of Avocados learned latent representation for computational genomics and epigenomics.

bioinformatics↗