Search PubMed⌕ Search
Home/Archive/PubMed

PubMed · 34583241

Towards a CRISPeR understanding of homologous recombination with high-throughput functional genomics.

Samuel B Hayward·Alberto Ciccia
View original source ↗Export metadata ↓

Abstract

CRISPR-dependent genome editing enables the study of genes and mutations on a large scale. Here we review CRISPR-based functional genomics technologies that generate gene knockouts and single nucleotide variants (SNVs) and discuss how their use has provided new important insights into the function of homologous recombination (HR) genes. In particular, we highlight discoveries from CRISPR screens that have contributed to define the response to PARP inhibition in cells deficient for the HR genes BRCA1 and BRCA2, uncover genes whose loss causes synthetic lethality in combination with BRCA1/2 deficiency, and characterize the function of BRCA1/2 SNVs of uncertain clinical significance. Further use of these approaches, combined with next-generation CRISPR-based technologies, will aid to dissect the genetic network of the HR pathway, define the impact of HR mutations on cancer etiology and treatment, and develop novel targeted therapies for HR-deficient tumors.

Explore related subjects

Gene Regulatory NetworksGenomicsHomologous RecombinationMutationPoly(ADP-ribose) Polymerase InhibitorsJournal ArticleResearch Support, N.I.H., ExtramuralReview

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Samuel B Hayward, Alberto Ciccia. 2021-09-25. Towards a CRISPeR understanding of homologous recombination with high-throughput functional genomics.. https://doi.org/10.1016/j.gde.2021.08.006

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

PubMed2027

Inferring Gene Regulatory Networks in Stem Cells: Methods and Applications.

Gene regulatory networks (GRNs) represent the complex interplay of transcription factors, regulatory elements, and target genes that orchestrate cellular identity and function, playing a crucial role in the differentiation and maintenance of stem cells. This chapter provides an overview of experimental and computational methodologies for inferring GRNs, with particular emphasis on single-cell approaches. We first review key experimental techniques for detecting transcription factor binding sites, chromatin accessibility, and DNA motifs, alongside essential databases that support GRN reconstruction. We then introduce computational inference methods that can be categorized into four principal frameworks: correlation-based approaches, regression and machine learning models, probabilistic and deep learning methods, and integrative or message-passing frameworks. To illustrate practical application, we present a case study applying the pySCENIC workflow to a peripheral blood mononuclear cell single-cell RNA sequencing dataset from mouse, demonstrating how regulon-based analysis can reveal cell-type-specific regulatory programs. This chapter aims to serve as a practical guide for researchers seeking to understand and implement GRN inference methodologies in stem cell biology and related fields.

Gene Regulatory Networks↗
PubMed2026

Modelling the effects of biological intervention in a dynamical gene network.

Cellular response to environmental and internal signals can be modeled by dynamical gene regulatory networks (GRN). In the literature, three main classes of gene network models can be distinguished: (1) non-quantitative (or data-based) models which do not describe the probability distribution of gene expressions; (2) quantitative models which fully describe the probability distribution of all genes co-expression; and (3) mechanistic models which allow for a causal interpretation of gene interactions. We propose two rigorous frameworks to model gene alteration in a dynamical GRN, depending on whether the network model is quantitative or mechanistic. We explain how these models can be used for design of experiment, or, if additional alteration data are available, for validation purposes or to improve the parameter estimation of the original model. We apply these methods to the Gaussian graphical model, which is quantitative but non-mechanistic, and to mechanistic models of Bayesian networks and penalized linear regression.

Gene Regulatory Networks↗
PubMed2026

Making multi-axis Gaussian graphical models scalable to millions of cells.

MOTIVATION: Networks underlie the generation and interpretation of many biological datasets: gene networks shed light on the regulatory structure of the genome, and cell networks can capture structure of the tumor micro-environment. However, most methods that learn such networks make the faulty "independence assumption"; to learn the gene network, they assume that no cell network exists. "Multi-axis" methods, which do not make this assumption, fail to scale beyond a few thousand cells or genes. This limits their applicability to only the smallest datasets. RESULTS: We develop a multi-axis method, which learns conditional dependency networks, capable of processing million-cell datasets within minutes. This was previously impossible, and unlocks the use of such methods on modern scRNA-seq datasets, as well as more complex datasets. We apply the method to a new scRNA-seq dataset for neuronal cell development, and compare the result to an existing state of the art method, hdWGCNA. We demonstrate that the new method yields gene networks that have a more focused biological interpretation and that the simultaneously learned cell network has advantages over a conventional kNN-based clustering. Further, our method yields novel biological insights by identifying long non-coding RNAs that potentially have a role in neuronal development. AVAILABILITY AND IMPLEMENTATION: Our methodology is available as a Python package GmGM on PyPI (https://pypi.org/project/GmGM/0.5.3/). The code for all experiments performed in this article is available on GitHub (https://github.com/BaileyAndrew/GmGM-Bioinformatics) and Zenodo (10.5281/zenodo.20384566).

Gene Regulatory Networks↗