Vicky Yao

Vicky Yao

Auto-generated profile, based on publicly available information

Vicky Yao

Department of Computer Science, Rice University

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
1 April 2022 in Nature Communications
Verified
Journal Article
Open access
PDF file
NSNicolae Sapoval
Nicolae Sapoval
AAAmirali Aghazadeh
Amirali Aghazadeh
MNMichael G. Nute
Michael G. Nute
DADinler Antunes
Dinler Antunes
ABAdvait Balaji
Advait Balaji
TTTodd J Treangen
Todd J Treangen
Deep Learning (DL) has recently enabled unprecedented advances in one of the grand challenges in computational biology: the half-century-old problem of protein structure prediction. In this paper we discuss recent advances, limitations, and future perspectives of DL on five broad areas: protein structure prediction, protein function prediction, genome engineering, systems biology and data integration, and phylogenetic inference. We discuss each application area and cover the main bottlenecks of DL approaches, such as training data, problem scope, and the ability to leverage existing DL architectures in new contexts. To conclude, we provide a summary of the subject-specific and general challenges for DL across the biosciences.

29 June 2020 in Neuron
Verified
Journal Article
Open access
JRJean-Pierre Roussarie
Jean-Pierre Roussarie
VYVicky Yao
Vicky Yao
PRPatricia Rodriguez-Rodriguez
Patricia Rodriguez-Rodriguez
RORose Oughtred
Rose Oughtred
JRJennifer Rust
Jennifer Rust
PGPaul Greengard
Paul Greengard
A major obstacle to treating Alzheimer’s disease (AD) is our lack of understanding of the molecular mechanisms underlying selective neuronal vulnerability, which is a key characteristic of the disease. Here we present a framework integrating high-quality neuron type-specific molecular profiles across the lifetime of the healthy mouse, which we generated using bacTRAP, with postmortem human functional genomics and quantitative genetics data. We demonstrate human-mouse conservation of cellular taxonomy at the molecular level for neurons vulnerable and resistant in AD, identify specific genes and pathways associated with AD neuropathology, and pinpoint a specific functional gene module underlying selective vulnerability, enriched in processes associated with axonal remodeling, and affected by both amyloid accumulation and aging. We have made all cell-type specific profiles and functional networks available at alz.princeton.edu. Overall, our study provides a molecular framework for understanding the complex interplay between Aβ, aging, and neurodegeneration within the most vulnerable neurons in AD.

1 October 2025 in Nature Communications
Verified
Journal Article
Open access
PDF file
QLQiliang Lai
Qiliang Lai
RDRuth Dannenfelser
Ruth Dannenfelser
JRJean-Pierre Roussarie
Jean-Pierre Roussarie
VYVicky Yao
Vicky Yao
Integrating single-cell RNA sequencing with Genome-Wide Association Studies (GWAS) can uncover cell types involved in complex traits and disease. However, current methods often lack scalability, interpretability, and robustness. We present seismic, a framework that computes a novel specificity score capturing both expression magnitude and consistency across cell types and introduces influential gene analysis, an approach to identify genes driving each cell type-trait association. Across over 1000 cell-type characterizations at different granularities and 28 polygenic traits, seismic corroborates known associations and uncovers trait-relevant cell groups not apparent through other methodologies. In Parkinson’s and Alzheimer’s, seismic unveils both cell- and brain-region-specific differences in pathology. Analyzing a pathology-based Alzheimer’s GWAS with seismic enables the identification of vulnerable neuron populations and molecular pathways implicated in their neurodegeneration. In general, seismic is a computationally efficient, powerful, and interpretable approach for mapping the relationships between polygenic traits and cell-type-specific expression, offering new insights into disease mechanisms.

26 August 2023 in Bioinformatics
Verified
Journal Article
Open access
PDF file
LLLechuan Li
Lechuan Li
RDRuth Dannenfelser
Ruth Dannenfelser
YZYu Zhu
Yu Zhu
NHNathaniel Hejduk
Nathaniel Hejduk
SSSantiago Segarra
Santiago Segarra
VYVicky Yao
Vicky Yao
Motivation: Model organisms are widely used to better understand the molecular causes of human disease. While sequence similarity greatly aids this cross-species transfer, sequence similarity does not imply functional similarity, and thus, several current approaches incorporate protein–protein interactions to help map findings between species. Existing transfer methods either formulate the alignment problem as a matching problem which pits network features against known orthology, or more recently, as a joint embedding problem.Results: We propose a novel state-of-the-art joint embedding solution: Embeddings to Network Alignment (ETNA). ETNA generates individual network embeddings based on network topological structure and then uses a Natural Language Processing-inspired cross-training approach to align the two embeddings using sequence-based orthologs. The final embedding preserves both within and between species gene functional relationships, and we demonstrate that it captures both pairwise and group functional relevance. In addition, ETNA’s embeddings can be used to transfer genetic interactions across species and identify phenotypic alignments, laying the groundwork for potential opportunities for drug repurposing and translational studies.Availability and implementation: https://github.com/ylaboratory/ETNA

1 February 2025 in bioRxiv
Verified
Preprint
Open access
PDF file
JZJeffrey Zhong
Jeffrey Zhong
LLLechuan Li
Lechuan Li
RDRuth Dannenfelser
Ruth Dannenfelser
VYVicky Yao
Vicky Yao
Accurate, data-driven representations of genes are critical for interpreting high-throughput biological data, yet no consensus exists on the most effective embedding strategy for common functional prediction tasks. Here, we present a systematic comparison of 38 gene embedding methods derived from amino acid sequences, gene expression profiles, protein–protein interaction networks, and biomedical literature. We benchmark each approach across three classes of tasks: predicting individual gene attributes, characterizing paired gene interactions, and assessing gene set relationships while trying to control for data leakage. Overall, we find that literature-based embeddings deliver superior performance across prediction tasks, sequence-based models excel in genetic interaction predictions, and expression-derived representations are well-suited for disease-related associations. Interestingly, network embeddings achieve similar performance to literature-based embeddings on most tasks despite using significantly smaller training sets. The type of training data has a greater influence on performance than the specific embedding construction method, with embedding dimensionality having only minimal impact. Our benchmarks clarify the strengths and limitations of current gene embeddings, providing practical guidance for selecting representations for downstream biological applications.

14 May 2018 in PLOS Computational Biology
Verified
Journal Article
Open access
PDF file
ARAaditya V. Rangan
Aaditya V. Rangan
CMCaroline C. McGrouther
Caroline C. McGrouther
JKJohn Kelsoe
John Kelsoe
NSNicholas Schork
Nicholas Schork
ESEli Stahl
Eli Stahl
BCBipolar Disorders Working Group of the Psychiatric Genomics Consortium
Bipolar Disorders Working Group of the Psychiatric Genomics Consortium
A common goal in data-analysis is to sift through a large data-matrix and detect any significant submatrices (i.e., biclusters) that have a low numerical rank. We present a simple algorithm for tackling this biclustering problem. Our algorithm accumulates information about 2-by-2 submatrices (i.e., ‘loops’) within the data-matrix, and focuses on rows and columns of the data-matrix that participate in an abundance of low-rank loops. We demonstrate, through analysis and numerical-experiments, that this loop-counting method performs well in a variety of scenarios, outperforming simple spectral methods in many situations of interest. Another important feature of our method is that it can easily be modified to account for aspects of experimental design which commonly arise in practice. For example, our algorithm can be modified to correct for controls, categorical- and continuous-covariates, as well as sparsity within the data. We demonstrate these practical features with two examples; the first drawn from gene-expression analysis and the second drawn from a much larger genome-wide-association-study (GWAS). An important problem in genomics is how to detect the genetic signatures associated with disease. When a disease is caused by a single well-defined biological mechanism, the genetic signature often involves a handful of genes present across the majority of the diseased patients. On the other hand, when a disease is complicated or poorly understood there may be many possible biological mechanisms at play. Any genetic signatures associated with such a disease may involve multiple genes, and each signature might only manifest across a subset of the diseased patients. Finding the signatures responsible for this heterogeneity requires searching through subsets of genes and subsets of patients—a problem referred to as ‘biclustering’. In this paper we present a new biclustering method which can scale up efficiently to handle large genomic data sets, such as GWAS-data. Our method is quite accurate, outperforming current ‘spectral’ biclustering methods for many problems of interest. Perhaps most importantly, our method can be corrected for many features of experimental design, such as controls, covariates and sparsity—all of which are especially important when analyzing real data sets.