Kejue Jia

Kejue Jia

Auto-generated profile, based on publicly available information

Kejue Jia

Yale University

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
1 February 2016 in Journal of Molecular Biology
Verified
Journal Article
Closed access
MZMichael Zimmermann
Michael Zimmermann
KJKejue Jia
Kejue Jia
Robert JerniganRobert Jernigan
Robert Jernigan

6 March 2017 in Proceedings of the National Academy of Sciences
Verified
Journal Article
Closed access
PDF file
KSKannan Sankar
Kannan Sankar
KJKejue Jia
Kejue Jia
Robert JerniganRobert Jernigan
Robert Jernigan
Significance: The protein folding process is dictated by the free-energy landscape and thus accurate prediction of the native structures of proteins requires reliable estimates of free energies. Computed energies of proteins are at present significantly more reliable than entropies. In this work, we introduce an innovative method to estimate the local conformational entropies of protein structures by using statistical data from observed amino acid contact changes during conformational transitions within a set of diverse protein structures. Combining these new entropies with cooperative potential energy functions yields significant gains in the ability to distinguish between native structures of proteins and their nonnative decoys.

27 January 2025 in Current Opinion in Structural Biology
Verified
Journal Article
Closed access
MKMesih Kilinc
Mesih Kilinc
KJKejue Jia
Kejue Jia
Robert JerniganRobert Jernigan
Robert Jernigan

3 September 2014
Verified
Book Chapter
Open access
PDF file
AKAtaur R. Katebi
Ataur R. Katebi
KSKannan Sankar
Kannan Sankar
KJKejue Jia
Kejue Jia
Robert JerniganRobert Jernigan
Robert Jernigan
The number of solved protein structures submitted in the Protein Data Bank (PDB) has increased dramatically in recent years. For some specific proteins, this number is very high—for example, there are over 550 solved structures for HIV-1 protease, one protein that is essential for the life cycle of human immunodeficiency virus (HIV) which causes acquired immunodeficiency syndrome (AIDS) in humans. The large number of structures for the same protein and its variants include a sample of different conformational states of the protein. A rich set of structures solved experimentally for the same protein has information buried within the dataset that can explain the functional dynamics and structural mechanism of the protein. To extract the dynamics information and functional mechanism from the experimental structures, this chapter focuses on two methods—Principal Component Analysis (PCA) and Elastic Network Models (ENM). PCA is a widely used statistical dimensionality reduction technique to classify and visualize high-dimensional data. On the other hand, ENMs are well-established simple biophysical method for modeling the functionally important global motions of proteins. This chapter covers the basics of these two. Moreover, an improved ENM version that utilizes the variations found within a given set of structures for a protein is described. As a practical example, we have extracted the functional dynamics and mechanism of HIV-1 protease dimeric structure by using a set of 329 PDB structures of this protein. We have described, step by step, how to select a set of protein structures, how to extract the needed information from the PDB files for PCA, how to extract the dynamics information using PCA, how to calculate ENM modes, how to measure the congruency between the dynamics computed from the principal components (PCs) and the ENM modes, and how to compute entropies using the PCs. We provide the computer programs or references to software tools to accomplish each step and show how to use these programs and tools. We also include computer programs to generate movies based on PCs and ENM modes and describe how to visualize them.

13 March 2022 in bioRxiv
Verified
Preprint
Open access
PDF file
MKMesih Kilinc
Mesih Kilinc
KJKejue Jia
Kejue Jia
Robert JerniganRobert Jernigan
Robert Jernigan
Motivation There are now 225 million sequences in the UniProtKB database, as of January 2022 and 451 million protein sequences in the NCBI non-redundant database. This huge sequence data is ripe for analysis and can be extremely informative about biological function when analyzed with the appropriate methods. Evolutionary information such as the relationship among protein sequences is key to performing sequence analyses. Since sequence matching is one of the primary ways that annotations are found, higher-quality sequence matches yield a larger number of identified homologs. Thus, there is an essential need for a faster and more accurate homolog detection method to process the huge amount of rapidly growing biological sequences. Method Recently, we have seen major improvements in various predictive computational tasks such as structure prediction from the ever-improving artificial intelligence methods. One such approach has been to use language models to represent proteins numerically in a representation matrix (embeddings) while retaining context-dependent biochemical, biophysical, and evolutionary information. Computational transformer architectures that utilize attention neural networks can generate these context-aware numerical representations in an unsupervised fashion. One such use for these protein embeddings is remote homolog detection. In this work, we utilize protein language models and then apply discrete cosine transforms to extract the essential part of these embeddings, resulting in a significantly smaller fixed-size matrix for each sequence. This allows us to numerically and efficiently calculate the distance between all pairs of proteins resulting in homolog detection. Results Our Protein LAnguage model Search Tool (PLAST) is significantly faster, with linear runtimes in the number of sequences within the query database. With only one CPU core, it can scan a million sequences in less than a second. It essentially removes the noise in the sequence data and leads to significant improvements. PLAST is more accurate in the benchmarks tested from the PFAM, SCOP, and CATH databases than other approaches. When benchmarked with the PFAM database, the increase in the area under the receiver operating characteristic curve (AUROC) 3.1% when compared with NCBI-BLAST. The number of remote homologs that are detectable now is significantly larger and pushes sequence matches deeply into the usual twilight zone. Compared with the state-of-the-art profile-based homology search tools like CSBLAST, the increase was still 2.0%. PLAST can find remote homologs for a significant number of proteins that had been thought to be unique due to homolog detection failure. These homologs that are found usually have less than 20% sequence identity making them indistinguishable from noise with most other sequence matching methods. Conclusion PLAST is an accurate and fast homolog detection tool essential for easy and rapid progress to utilize the vast amount of data generated by next-generation sequencing methods. Quantization of sequence embeddings into highly-compressed noise-free representations with the use of direct cosine transforms allows for the efficient and accurate detection of normal homologs and remote ones that are un-detectable by other sequence similarity methods. The PLAST web server is accessible from https://mesihk.github.io/plast.

12 July 2021 in The Annals of Applied Statistics
Verified
Journal Article
Closed access
PDF file
Robert JerniganRobert Jernigan
Robert Jernigan
KJKejue Jia
Kejue Jia
ZRZhao Ren
Zhao Ren
WZWen Zhou
Wen Zhou
Measuring the dependence of k≥3 random variables and drawing inference from such higher-order dependences are scientifically important yet challenging. Motivated here by protein coevolution with multivariate categorical features, we consider an information theoretic measure of higher-order dependence. The proposed collective dependence is a symmetrization of differential interaction information which generalizes the mutual information of a pair of random variables. We show that the collective dependence can be easily estimated and facilitates a test on the dependence of k≥3 random variables. Upon carefully exploring the null space of collective dependence, we devise a Classification-Assisted Large scaLe inference procedure to DEtect significant k-COllective DEpendence among d≥k random variables, with the false discovery rate controlled. Finite sample performance of our method is examined via simulations. We apply this method to the multiple protein sequence alignment data to study the residue or position coevolution for two protein families, the elongation factor P family and the zinc knuckle family. We identify novel functional triplets of amino acid residues, whose contributions to the protein function are further investigated. These confirm that the collective dependence does yield additional information important for understanding the protein coevolution compared to the pairwise measures.