Erfaneh Gharavi

Dr. Erfaneh Gharavi


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 February 2022 in Iran Journal of Computer Science
Verified
Journal Article
Closed access
PDF file
HVHadi Veisi
Hadi Veisi
MGMahboobeh Golchinpour
Mahboobeh Golchinpour
MSMostafa Salehi
Mostafa Salehi
EGErfaneh Gharavi
Erfaneh Gharavi

8 March 2024 in Bioengineering
Verified
Journal Article
Open access
PDF file
EGErfaneh Gharavi
Erfaneh Gharavi
NLNathan J. LeRoy
Nathan J. LeRoy
GZGuangtao Zheng
Guangtao Zheng
AZAidong Zhang
Aidong Zhang
DBDonald Brown
Donald Brown
NSNathan Sheffield
Nathan Sheffield
As available genomic interval data increase in scale, we require fast systems to search them. A common approach is simple string matching to compare a search term to metadata, but this is limited by incomplete or inaccurate annotations. An alternative is to compare data directly through genomic region overlap analysis, but this approach leads to challenges like sparsity, high dimensionality, and computational expense. We require novel methods to quickly and flexibly query large, messy genomic interval databases. Here, we develop a genomic interval search system using representation learning. We train numerical embeddings for a collection of region sets simultaneously with their metadata labels, capturing similarity between region sets and their metadata in a low-dimensional space. Using these learned co-embeddings, we develop a system that solves three related information retrieval tasks using embedding distance computations: retrieving region sets related to a user query string, suggesting new labels for database region sets, and retrieving database region sets similar to a query region set. We evaluate these use cases and show that jointly learned representations of region sets and metadata are a promising approach for fast, flexible, and accurate genomic region information retrieval.

2 July 2024 in NAR Genomics and Bioinformatics
Verified
Journal Article
Open access
PDF file
GZGuangtao Zheng
Guangtao Zheng
JRJulia Rymuza
Julia Rymuza
EGErfaneh Gharavi
Erfaneh Gharavi
NLNathan J LeRoy
Nathan J LeRoy
AZAidong Zhang
Aidong Zhang
NSNathan Sheffield
Nathan Sheffield
Representation learning models have become a mainstay of modern genomics. These models are trained to yield vector representations, or embeddings, of various biological entities, such as cells, genes, individuals, or genomic regions. Recent applications of unsupervised embedding approaches have been shown to learn relationships among genomic regions that define functional elements in a genome. Unsupervised representation learning of genomic regions is free of the supervision from curated metadata and can condense rich biological knowledge from publicly available data to region embeddings. However, there exists no method for evaluating the quality of these embeddings in the absence of metadata, making it difficult to assess the reliability of analyses based on the embeddings, and to tune model training to yield optimal results. To bridge this gap, we propose four evaluation metrics: the cluster tendency score (CTS), the reconstruction score (RCS), the genome distance scaling score (GDSS), and the neighborhood preserving score (NPS). The CTS and RCS statistically quantify how well region embeddings can be clustered and how well the embeddings preserve information in training data. The GDSS and NPS exploit the biological tendency of regions close in genomic space to have similar biological functions; they measure how much such information is captured by individual region embeddings in a set. We demonstrate the utility of these statistical and biological scores for evaluating unsupervised genomic region embeddings and provide guidelines for learning reliable embeddings.

2 July 2024 in NAR Genomics and Bioinformatics
Verified
Journal Article
Open access
PDF file
NLNathan J LeRoy
Nathan J LeRoy
JSJason Paul Smith
Jason Paul Smith
GZGuangtao Zheng
Guangtao Zheng
JRJulia Rymuza
Julia Rymuza
EGErfaneh Gharavi
Erfaneh Gharavi
NSNathan Sheffield
Nathan Sheffield
Data from the single-cell assay for transposase-accessible chromatin using sequencing (scATAC-seq) are now widely available. One major computational challenge is dealing with high dimensionality and inherent sparsity, which is typically addressed by producing lower dimensional representations of single cells for downstream clustering tasks. Current approaches produce such individual cell embeddings directly through a one-step learning process. Here, we propose an alternative approach by building embedding models pre-trained on reference data. We argue that this provides a more flexible analysis workflow that also has computational performance advantages through transfer learning. We implemented our approach in scEmbed, an unsupervised machine-learning framework that learns low-dimensional embeddings of genomic regulatory regions to represent and analyze scATAC-seq data. scEmbed performs well in terms of clustering ability and has the key advantage of learning patterns of region co-occurrence that can be transferred to other, unseen datasets. Moreover, models pre-trained on reference data can be exploited to build fast and accurate cell-type annotation systems without the need for other data modalities. scEmbed is implemented in Python and it is available to download from GitHub. We also make our pre-trained models available on huggingface for public use. scEmbed is open source and available at https://github.com/databio/geniml. Pre-trained models from this work can be obtained on huggingface: https://huggingface.co/databio.

29 August 2023 in bioRxiv
Verified
Preprint
Open access
PDF file
GZGuangtao Zheng
Guangtao Zheng
JRJulia Rymuza
Julia Rymuza
EGErfaneh Gharavi
Erfaneh Gharavi
NLNathan J. LeRoy
Nathan J. LeRoy
AZAidong Zhang
Aidong Zhang
NSNathan Sheffield
Nathan Sheffield
Background Representation learning models have become a mainstay of modern genomics. These models are trained to yield vector representations, or embeddings, of various biological entities, such as cells, genes, individuals, or genomic regions. Recent applications of unsupervised embedding approaches have been shown to learn relationships among genomic regions that define functional elements in a genome. Unsupervised representation learning of genomic regions is free of the supervision from curated metadata and can condense rich biological knowledge from publicly available data to region embeddings. However, there exists no method for evaluating the quality of these embeddings in the absence of metadata, making it difficult to assess the reliability of analyses based on the embeddings, and to tune model training to yield optimal results. Methods To bridge this gap, we propose four evaluation metrics: the cluster tendency test (CTT), the reconstruction test (RCT), the genome distance scaling test (GDST), and the neighborhood preserving test (NPT). The CTT and RCT are statistical methods that evaluate how well region embeddings can be clustered and how much the embeddings can preserve the information contained in training data. The GDST and NPT exploit the biological tendency of regions close in genomic space to have similar biological functions; they measure how much such information is captured by individual region embeddings and a set of region embeddings. Results We demonstrate the utility of these statistical and biological tests for evaluating unsupervised genomic region embeddings and provide guidelines for learning reliable embeddings. Availability Code is available at https://github.com/databio/geniml.

3 August 2023 in bioRxiv
Verified
Preprint
Open access
PDF file
NLNathan J. LeRoy
Nathan J. LeRoy
JSJason Paul Smith
Jason Paul Smith
GZGuangtao Zheng
Guangtao Zheng
JRJulia Rymuza
Julia Rymuza
EGErfaneh Gharavi
Erfaneh Gharavi
NSNathan Sheffield
Nathan Sheffield
Motivation Data from the single-cell assay for transposase-accessible chromatin using sequencing (scATAC-seq) is now widely available. One major computational challenge is dealing with high dimensionality and inherent sparsity, which is typically addressed by producing lower-dimensional representations of single cells for downstream clustering tasks. Current approaches produce such individual cell embeddings directly through a one-step learning process. Here, we propose an alternative approach by building embedding models pre-trained on reference data. We argue that this provides a more flexible analysis workflow that also has computational performance advantages through transfer learning. Results We implemented our approach in scEmbed, an unsupervised machine learning framework that learns low-dimensional embeddings of genomic regulatory regions to represent and analyze scATAC-seq data. scEmbed is competitive with alternative scATAC embedding approaches in terms of clustering ability and has the advantage of learning patterns of region co-occurrence that can be transferred to other, unseen datasets. Moreover, pre-trained models on reference data can be exploited to build fast and accurate cell-type annotation systems without the need for other data modalities. scEmbed is implemented in Python and it is available to download from GitHub. We also make our pre-trained models available on huggingface for public use. Availability scEmbed is open source and available at https://github.com/databio/geniml. Pre-trained models from this work can be obtained on huggingface: https://huggingface.co/databio.