Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jishou Ruan

dblp:36/6677 · DBLP profile ↗
← Back
9ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 7Artificial intelligence and machine learning · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › drug discovery › target identification
drug target identification
0.212014
Human structural proteome-wide characterization of Cyclosporine A targets · Bioinform. 2014
Bioinformatics and computational biology › drug discovery › computational drug discovery
protein-ligand interaction prediction
0.212014
Human structural proteome-wide characterization of Cyclosporine A targets · Bioinform. 2014
Bioinformatics and computational biology › protein function prediction › functional residue prediction
catalytic residue prediction
0.112008
Accurate sequence-based prediction of catalytic residues · Bioinform. 2008
Bioinformatics and computational biology
protein function prediction
0.112008
Accurate sequence-based prediction of catalytic residues · Bioinform. 2008
Bioinformatics and computational biology › proteomics
structural proteomics
0.112014
Human structural proteome-wide characterization of Cyclosporine A targets · Bioinform. 2014

Methods — techniques the papers use, named apart from their topics

surface plasmon resonance · 0.2molecular dynamics · 0.2molecular docking · 0.2enzymatic assay · 0.2support vector machine · 0.1feature selection · 0.1PSI-BLAST · 0.1
YearPublicationVenuePosition
2019 Detecting distant-homology protein structures by aligning deep neural-network based contact maps
abstract
Accurate prediction of atomic-level protein structure is important for annotating the biological functions of protein molecules and for designing new compounds to regulate the functions. Template-based modeling (TBM), which aims to construct structural models by copying and refining the structural frameworks of other known proteins, remains the most accurate method for protein structure prediction. Due to the difficulty in recognizing distant-homology templates, however, the accuracy of TBM decreases rapidly when the evolutionary relationship between the query and template vanishes. In this study, we propose a new method, CEthreader, which first predicts residue-residue contacts by coupling evolutionary precision matrices with deep residual convolutional neural-networks. The predicted contact maps are then integrated with sequence profile alignments to recognize structural templates from the PDB. The method was tested on two independent benchmark sets consisting collectively of 1,153 non-homologous protein targets, where CEthreader detected 176% or 36% more correct templates with a TM-score >0.5 than the best state-of-the-art profile- or contact-based threading methods, respectively, for the Hard targets that lacked homologous templates. Moreover, CEthreader was able to identify 114% or 20% more correct templates with the same Fold as the query, after excluding structures from the same SCOPe Superfamily, than the best profile- or contact-based threading methods. Detailed analyses show that the major advantage of CEthreader lies in the efficient coupling of contact maps with profile alignments, which helps recognize global fold of protein structures when the homologous relationship between the query and template is weak. These results demonstrate an efficient new strategy to combine ab initio contact map prediction with profile alignments to significantly improve the accuracy of template-based structure prediction, especially for distant-homology proteins.
Wei Zheng 0013, Qiqige Wuyun, Yang Li 0107, S. M. Mortuza, Robin Pearce, Jishou Ruan, Yang Zhang 0040
PLoS Comput. Biol.7
2019 Disease Gene Prediction by Integrating PPI Networks, Clinical RNA-Seq Data and OMIM Data
abstract
Disease gene prediction is a challenging task that has a variety of applications such as early diagnosis and drug development. The existing machine learning methods suffer from the imbalanced sample issue because the number of known disease genes (positive samples) is much less than that of unknown genes which are typically considered to be negative samples. In addition, most methods have not utilized clinical data from patients with a specific disease to predict disease genes. In this study, we propose a disease gene prediction algorithm (called dgSeq) by combining protein-protein interaction (PPI) network, clinical RNA-Seq data, and Online Mendelian Inheritance in Man (OMIN) data. Our dgSeq constructs differential networks based on rewiring information calculated from clinical RNA-Seq data. To select balanced sets of non-disease genes (negative samples), a disease-gene network is also constructed from OMIM data. After features are extracted from the PPI networks and differential networks, the logistic regression classifiers are trained. Our dgSeq obtains AUC values of 0.88, 0.83, and 0.80 for identifying breast cancer genes, thyroid cancer genes, and Alzheimer's disease genes, respectively, which indicates its superiority to other three competing methods. Both gene set enrichment analysis and predicted results demonstrate that dgSeq can effectively predict new disease genes.
Ping Luo 0003, Liping Tian 0001, Jishou Ruan, Fang-Xiang Wu
IEEE ACM Trans. Comput. Biol. Bioinform.3
2016 Identifying disease genes from PPI networks weighted by gene expression under different conditions
abstract
The identification of disease genes is an essential issue to decipher the mechanisms of complex diseases. Many existing methods combine machine learning algorithms and network information to predict disease genes and are based on the `guilt by association' assumption, where disease genes are considered to be close to each other in a biomolecular network. Although these methods have gained many novel findings, most of them ignored the edge dynamic changes of biomolecular networks under different conditions when only utilizing the `guilt by association' principle, which will limit their performance. To address this problem, we propose an algorithm that combines the `guilt by association' and the `guilt by rewiring' of biomolecular networks at the same time. The difference of gene co-expression between case and control samples are first processed to obtain the edge dynamic changes (rewiring) of biomolecular networks through weighting the edges of protein-protein interaction (PPI) networks. Then, features are extracted from the weighted PPI network. Finally, a logistic regression is adopted to identify the disease genes. The algorithm achieves AUC values of 0.95, 0.90 and 0.92 on the identification of breast-cancer-related, lung-cancer-related and schizophrenia-related genes, respectively. Two new schizophrenia-related genes are also found from the ranked unknown genes list.
Ping Luo 0003, Liping Tian 0001, Jishou Ruan, Fang-Xiang Wu
BIBM3
2015 Reweighted sparse subspace clustering
Jun Xu 0019, Kui Xu 0004, Ke Chen 0003, Jishou Ruan
Comput. Vis. Image Underst.4
2014 Human structural proteome-wide characterization of Cyclosporine A targets
abstract
MOTIVATION: Off-target interactions of a popular immunosuppressant Cyclosporine A (CSA) with several proteins besides its molecular target, cyclophilin A, are implicated in the activation of signaling pathways that lead to numerous side effects of this drug. RESULTS: Using structural human proteome and a novel algorithm for inverse ligand binding prediction, ILbind, we determined a comprehensive set of 100+ putative partners of CSA. We empirically show that predictive quality of ILbind is better compared with other available predictors for this compound. We linked the putative target proteins, which include many new partners of CSA, with cellular functions, canonical pathways and toxicities that are typical for patients who take this drug. We used complementary approaches (molecular docking, molecular dynamics, surface plasmon resonance binding analysis and enzymatic assays) to validate and characterize three novel CSA targets: calpain 2, caspase 3 and p38 MAP kinase 14. The three targets are involved in the apoptotic pathways, are interconnected and are implicated in nephrotoxicity.
Gang Hu 0005, Jody Groenendyk, Khaled H. Barakat, Marcin J. Mizianty, Jishou Ruan, Marek Michalak, Lukasz A. Kurgan
Bioinform.6
2008 Accurate sequence-based prediction of catalytic residues
abstract
MOTIVATION: Prediction of catalytic residues provides useful information for the research on function of enzymes. Most of the existing prediction methods are based on structural information, which limits their use. We propose a sequence-based catalytic residue predictor that provides predictions with quality comparable to modern structure-based methods and that exceeds quality of state-of-the-art sequence-based methods. RESULTS: Our method (CRpred) uses sequence-based features and the sequence-derived PSI-BLAST profile. We used feature selection to reduce the dimensionality of the input (and explain the input) to support vector machine (SVM) classifier that provides predictions. Tests on eight datasets and side-by-side comparison with six modern structure- and sequence-based predictors show that CRpred provides predictions with quality comparable to current structure-based methods and better than sequence-based methods. The proposed method obtains 15-19% precision and 48-58% TP (true positive) rate, depending on the dataset used. CRpred also provides confidence values that allow selecting a subset of predictions with higher precision. The improved quality is due to newly designed features and careful parameterization of the SVM. The features incorporate amino acids characterized by the highest and the lowest propensities to constitute catalytic residues, Gly that provides flexibility for catalytic sites and sequence motifs characteristic to certain catalytic reactions. Our features indicate that catalytic residues are on average more conserved when compared with the general population of residues and that highly conserved amino acids characterized by high catalytic propensity are likely to form catalytic sites. We also show that local (with respect to the sequence) hydrophobicity contributes towards the prediction.
Hua Zhang 0011, Ke Chen 0003, Shiyi Shen, Jishou Ruan, Lukasz A. Kurgan
Bioinform.5
2008 Sequence based residue depth prediction using evolutionary information and predicted secondary structure
abstract
BACKGROUND: Residue depth allows determining how deeply a given residue is buried, in contrast to the solvent accessibility that differentiates between buried and solvent-exposed residues. When compared with the solvent accessibility, the depth allows studying deep-level structures and functional sites, and formation of the protein folding nucleus. Accurate prediction of residue depth would provide valuable information for fold recognition, prediction of functional sites, and protein design. RESULTS: A new method, RDPred, for the real-value depth prediction from protein sequence is proposed. RDPred combines information extracted from the sequence, PSI-BLAST scoring matrices, and secondary structure predicted with PSIPRED. Three-fold/ten-fold cross validation based tests performed on three independent, low-identity datasets show that the distance based depth (computed using MSMS) predicted by RDPred is characterized by 0.67/0.67, 0.66/0.67, and 0.64/0.65 correlation with the actual depth, by the mean absolute errors equal 0.56/0.56, 0.61/0.60, and 0.58/0.57, and by the mean relative errors equal 17.0%/16.9%, 18.2%/18.1%, and 17.7%/17.6%, respectively. The mean absolute and the mean relative errors are shown to be statistically significantly better when compared with a method recently proposed by Yuan and Wang [Proteins 2008; 70:509-516]. The results show that three-fold cross validation underestimates the variability of the prediction quality when compared with the results based on the ten-fold cross validation. We also show that the hydrophilic and flexible residues are predicted more accurately than hydrophobic and rigid residues. Similarly, the charged residues that include Lys, Glu, Asp, and Arg are the most accurately predicted. Our analysis reveals that evolutionary information encoded using PSSM is characterized by stronger correlation with the depth for hydrophilic amino acids (AAs) and aliphatic AAs when compared with hydrophobic AAs and aromatic AAs. Finally, we show that the secondary structure of coils and strands is useful in depth prediction, in contrast to helices that have relatively uniform distribution over the protein depth. Application of the predicted residue depth to prediction of buried/exposed residues shows consistent improvements in detection rates of both buried and exposed residues when compared with the competing method. Finally, we contrasted the prediction performance among distance based (MSMS and DPX) and volume based (SADIC) depth definitions. We found that the distance based indices are harder to predict due to the more complex nature of the corresponding depth profiles. CONCLUSION: The proposed method, RDPred, provides statistically significantly better predictions of residue depth when compared with the competing method. The predicted depth can be used to provide improved prediction of both buried and exposed residues. The prediction of exposed residues has implications in characterization/prediction of interactions with ligands and other proteins, while the prediction of buried residues could be used in the context of folding predictions and simulations.
Hua Zhang 0011, Ke Chen 0003, Shiyi Shen, Jishou Ruan, Lukasz A. Kurgan
BMC Bioinform.5
2006 Optimization of the Sliding Window Size for Protein Structure Prediction
abstract
Sliding window based methods are relatively often applied in prediction of various aspects related to protein structure. Despite their wide spread use, researchers did not establish a standard related to the size of the window, i.e., window sizes ranging between 7 and 17 residues were used in the past. To this end, this paper performs a computational study based on a probabilistic approach that aims at finding an optimal sliding window size. The results shows that formation of helical structure can be affected by amino acids (AAs) that are up to 9 positions away in the sequence, while the formation of coils and strands can be affected by AAs that are up to 3 and 6 positions away, respectively. Overall, our results suggest that a sliding window with 19 residues is optimal for secondary structure prediction, while for a specific prediction tasks, such as prediction of p-strands, a smaller window size is sufficient. Finally, the 20 AAs are categorized into five groups based on their influence of formation of the secondary structure. The finding related to the optimal window size was confirmed based on an independent experimental study related to the prediction of secondary protein structure
Ke Chen 0003, Lukasz A. Kurgan, Jishou Ruan
CIBCB3
2005 Highly accurate and consistent method for prediction of helix and strand content from primary protein sequences
Jishou Ruan, Lukasz A. Kurgan, Krzysztof J. Cios
Artif. Intell. Medicine1