Bi-Qing Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Bi-Qing Li has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Lei Chen
State Key Laboratory of Membrane Biology, College of Future Technology, Institute of Molecular Medicine, Beijing Key Laboratory of Novel Antibodies and Multifunctional Conjugated Drugs, Peking University, Beijing 100871, China
3 shared publications Jian Zhang
Department of Ophthalmology, Shanghai First People's Hospital, School of Medicine, Shanghai Jiao Tong University, Shanghai 200080, China
2 shared publicationsKai-Yan Feng
Beijing Genomics Institute, Shenzhen Beishan Industrial zone, Beishan Road, Yantian District, Shenzhen 518083, People’s Republic of China.,China
2 shared publications- Yu-Dong Cai
School of Life Sciences, Shanghai University, Shanghai 200444, China
2 shared publications Guohua Huang
Institute of Systems Biology, Shanghai University, Shanghai 200444, China ; Department of Mathematics, Shaoyang University, Shaoyang, Hunan 422000, China
1 shared publication- Guohui Ding
Key Lab of Systems Biology, Shanghai Institutes for Biological Sciences, Chinese Academy of Sciences, Shanghai, PR China
1 shared publication
Latest Publications
- Open Access
- 1 January 2017
- Published by Atlantis Press SARL
Office Automation Sub-Summary of the Work and the Project Management System
- 1 January 2017
- Published by Atlantis Press SARL
Open AccessOffice Automation Sub-Summary of the Work and the Project Management System
- Open Access
- 12 August 2014
- Published by Wiley in BioMed Research International
- Vol. 2014, 1-10
Prediction of S-Nitrosylation Modification Sites Based on Kernel Sparse Representation Classification and mRMR Algorithm
Protein S-nitrosylation plays a very important role in a wide variety of cellular biological activities. Hitherto, accurate prediction of S-nitrosylation sites is still of great challenge. In this paper, we presented a framework to computationally predict S-nitrosylation sites based on kernel sparse representation classification and minimum Redundancy Maximum Relevance algorithm. As much as 666 features derived from five categories of amino acid properties and one protein structure feature are used for numerical representation of proteins. A total of 529 protein sequences collected from the open-access databases and published literatures are used to train and test our predictor. Computational results show that our predictor achieves Matthews’ correlation coefficients of 0.1634 and 0.2919 for the training set and the testing set, respectively, which are better than those of k-nearest neighbor algorithm, random forest algorithm, and sparse representation classification algorithm. The experimental results also indicate that 134 optimal features can better represent the peptides of protein S-nitrosylation than the original 666 redundant features. Furthermore, we constructed an independent testing set of 113 protein sequences to evaluate the robustness of our predictor. Experimental result showed that our predictor also yielded good performance on the independent testing set with Matthews’ correlation coefficients of 0.2239.
- 12 August 2014
- Published by Wiley in BioMed Research International
- Vol. 2014, 1-10
Open AccessPrediction of S-Nitrosylation Modification Sites Based on Kernel Sparse Representation Classification and mRMR Algorithm
Protein S-nitrosylation plays a very important role in a wide variety of cellular biological activities. Hitherto, accurate prediction of S-nitrosylation sites is still of great challenge. In this paper, we presented a framework to computationally predict S-nitrosylation sites based on kernel sparse representation classification and minimum Redundancy Maximum Relevance algorithm. As much as 666 features derived from five categories of amino acid properties and one protein structure feature are used for numerical representation of proteins. A total of 529 protein sequences collected from the open-access databases and published literatures are used to train and test our predictor. Computational results show that our predictor achieves Matthews’ correlation coefficients of 0.1634 and 0.2919 for the training set and the testing set, respectively, which are better than those of k-nearest neighbor algorithm, random forest algorithm, and sparse representation classification algorithm. The experimental results also indicate that 134 optimal features can better represent the peptides of protein S-nitrosylation than the original 666 redundant features. Furthermore, we constructed an independent testing set of 113 protein sequences to evaluate the robustness of our predictor. Experimental result showed that our predictor also yielded good performance on the independent testing set with Matthews’ correlation coefficients of 0.2239.
- 31 October 2013
- Published by Bentham Science Publishers Ltd. in Current Bioinformatics
- Vol. 8 (5) , 545-551
Predicting Biological Functions of Protein Complexes Using Graphic and Functional Features.
Protein complexes involve in most if not all of essential biological processes in a living cell. Many attempts have been devoted to identify protein complexes using computational methods, most of which exploit protein-protein interaction networks to search intensively interacting proteins as a protein complex. Besides identifying protein complexes, knowing their biological functions may help unlock their molecular mechanisms and their roles in related biological processes. Therefore, it is also desirable to computationally predict the functions of protein complexes. However, no literature has been found to address such a problem. This paper attempts to address the problem by choosing yeast as the model organism, where total 50 protein complexes are collected and their functions are validated by solid experiments. Each of the complexes was encoded by a numeric vector based upon their graphic and functional properties. Feature selection techniques, including Minimum Redundancy Maximum Relevance and Incremental Feature Selection, were adopted to extract core features for the prediction. Three different prediction methods, Nearest Neighbor Algorithm, Bayesian network and Sequential Minimal Optimization, were utilized in this study and tested by jackknife crossvalidation test. Consequently, 22 core features coupled with Nearest Neighbor Algorithm gain the highest accuracy. These core features are regarded as the most important features for the determination of the biological functions of protein complexes. 19 out of 22 core features were from functional properties, indicating that the functions of each protein component probably constrain the overall functions of the protein complex.
- 31 October 2013
- Published by Bentham Science Publishers Ltd. in Current Bioinformatics
- Vol. 8 (5) , 545-551
Predicting Biological Functions of Protein Complexes Using Graphic and Functional Features.
Protein complexes involve in most if not all of essential biological processes in a living cell. Many attempts have been devoted to identify protein complexes using computational methods, most of which exploit protein-protein interaction networks to search intensively interacting proteins as a protein complex. Besides identifying protein complexes, knowing their biological functions may help unlock their molecular mechanisms and their roles in related biological processes. Therefore, it is also desirable to computationally predict the functions of protein complexes. However, no literature has been found to address such a problem. This paper attempts to address the problem by choosing yeast as the model organism, where total 50 protein complexes are collected and their functions are validated by solid experiments. Each of the complexes was encoded by a numeric vector based upon their graphic and functional properties. Feature selection techniques, including Minimum Redundancy Maximum Relevance and Incremental Feature Selection, were adopted to extract core features for the prediction. Three different prediction methods, Nearest Neighbor Algorithm, Bayesian network and Sequential Minimal Optimization, were utilized in this study and tested by jackknife crossvalidation test. Consequently, 22 core features coupled with Nearest Neighbor Algorithm gain the highest accuracy. These core features are regarded as the most important features for the determination of the biological functions of protein complexes. 19 out of 22 core features were from functional properties, indicating that the functions of each protein component probably constrain the overall functions of the protein complex.
- Open Access
- 5 September 2013
- Published by Wiley in BioMed Research International
- Vol. 2013, 1-10
Prediction of Effective Drug Combinations by Chemical Interaction, Protein Interaction and Target Enrichment of KEGG Pathways
Drug combinatorial therapy could be more effective in treating some complex diseases than single agents due to better efficacy and reduced side effects. Although some drug combinations are being used, their underlying molecular mechanisms are still poorly understood. Therefore, it is of great interest to deduce a novel drug combination by their molecular mechanisms in a robust and rigorous way. This paper attempts to predict effective drug combinations by a combined consideration of: (1) chemical interaction between drugs, (2) protein interactions between drugs’ targets, and (3) target enrichment of KEGG pathways. A benchmark dataset was constructed, consisting of 121 confirmed effective combinations and 605 random combinations. Each drug combination was represented by 465 features derived from the aforementioned three properties. Some feature selection techniques, including Minimum Redundancy Maximum Relevance and Incremental Feature Selection, were adopted to extract the key features. Random forest model was built with its performance evaluated by 5-fold cross-validation. As a result, 55 key features providing the best prediction result were selected. These important features may help to gain insights into the mechanisms of drug combinations, and the proposed prediction model could become a useful tool for screening possible drug combinations.
- 5 September 2013
- Published by Wiley in BioMed Research International
- Vol. 2013, 1-10
Open AccessPrediction of Effective Drug Combinations by Chemical Interaction, Protein Interaction and Target Enrichment of KEGG Pathways
Drug combinatorial therapy could be more effective in treating some complex diseases than single agents due to better efficacy and reduced side effects. Although some drug combinations are being used, their underlying molecular mechanisms are still poorly understood. Therefore, it is of great interest to deduce a novel drug combination by their molecular mechanisms in a robust and rigorous way. This paper attempts to predict effective drug combinations by a combined consideration of: (1) chemical interaction between drugs, (2) protein interactions between drugs’ targets, and (3) target enrichment of KEGG pathways. A benchmark dataset was constructed, consisting of 121 confirmed effective combinations and 605 random combinations. Each drug combination was represented by 465 features derived from the aforementioned three properties. Some feature selection techniques, including Minimum Redundancy Maximum Relevance and Incremental Feature Selection, were adopted to extract the key features. Random forest model was built with its performance evaluated by 5-fold cross-validation. As a result, 55 key features providing the best prediction result were selected. These important features may help to gain insights into the mechanisms of drug combinations, and the proposed prediction model could become a useful tool for screening possible drug combinations.
- Open Access
- 1 January 2013
- Published by Hindawi Limited in BioMed Research International
- Vol. 2013, 1-8
Prediction and Analysis of Retinoblastoma Related Genes through Gene Ontology and KEGG
One of the most important and challenging problems in biomedicine is how to predict the cancer related genes. Retinoblastoma (RB) is the most common primary intraocular malignancy usually occurring in childhood. Early detection of RB could reduce the morbidity and promote the probability of disease-free survival. Therefore, it is of great importance to identify RB genes. In this study, we developed a computational method to predict RB related genes based on Dagging, with the maximum relevance minimum redundancy (mRMR) method followed by incremental feature selection (IFS). 119 RB genes were compiled from two previous RB related studies, while 5,500 non-RB genes were randomly selected from Ensemble genes. Ten datasets were constructed based on all these RB and non-RB genes. Each gene was encoded with a 13,126-dimensional vector including 12,887 Gene Ontology enrichment scores and 239 KEGG enrichment scores. Finally, an optimal feature set including 1061 GO terms and 8 KEGG pathways was obtained. Analysis showed that these features were closely related to RB. It is anticipated that the method can be applied to predict the other cancer related genes as well.
- 1 January 2013
- Published by Hindawi Limited in BioMed Research International
- Vol. 2013, 1-8
Open AccessPrediction and Analysis of Retinoblastoma Related Genes through Gene Ontology and KEGG
One of the most important and challenging problems in biomedicine is how to predict the cancer related genes. Retinoblastoma (RB) is the most common primary intraocular malignancy usually occurring in childhood. Early detection of RB could reduce the morbidity and promote the probability of disease-free survival. Therefore, it is of great importance to identify RB genes. In this study, we developed a computational method to predict RB related genes based on Dagging, with the maximum relevance minimum redundancy (mRMR) method followed by incremental feature selection (IFS). 119 RB genes were compiled from two previous RB related studies, while 5,500 non-RB genes were randomly selected from Ensemble genes. Ten datasets were constructed based on all these RB and non-RB genes. Each gene was encoded with a 13,126-dimensional vector including 12,887 Gene Ontology enrichment scores and 239 KEGG enrichment scores. Finally, an optimal feature set including 1061 GO terms and 8 KEGG pathways was obtained. Analysis showed that these features were closely related to RB. It is anticipated that the method can be applied to predict the other cancer related genes as well.
- 1 January 2013
- Published by Bentham Science Publishers Ltd. in Protein & Peptide Letters
- Vol. 20 (3) , 352-363
MicroRNA Mediated Network and DNA Methylation in Colorectal Cancer
Colorectal cancer (CRC) is one of the most malignant cancers. A growing number of studies have shown that both genetic and epigenetic play important roles in the etiology of CRC. Both microRNA (miRNA) and DNA methylation belong to the scope of epigenetic and there are complex regulatory mechanisms within miRNA and DNA methylation. We compiled 71 CRC related genes and 134 CRC related miRNAs. Then we identified 417 feed forward loops (FFLs) and 37 feedback loops (FBLs) among these genes, miRNAs and transcription factors (TFs). We constructed a network of miRNAs and TFs mediation for CRC utilizing these FFLs and FBLs. Statistical tests proved that these FFLs were significantly enriched in the CRC comparing to the esophageal cancer, breast cancer and randomly selected CRCmiRNA-gene pairs. Analysis of the network singled out 3 core genes, 2 core miRNAs and 5 core TFs. The KEGG enrichment and GO enrichment for the 2 core miRNA target genes indicated that they were significantly enriched in CRC related pathways. (Ex. MARK pathway, TGFβ pathway and cell cycle) Through the investigation on methylation, we found that most of the CRC related genes and miRNAs were prone to be regulated by methylation. This study sheds lights on the regulatory mechanisms in CRC and we provide some insights on the epigenetic of CRC.
- 1 January 2013
- Published by Bentham Science Publishers Ltd. in Protein & Peptide Letters
- Vol. 20 (3) , 352-363
MicroRNA Mediated Network and DNA Methylation in Colorectal Cancer
Colorectal cancer (CRC) is one of the most malignant cancers. A growing number of studies have shown that both genetic and epigenetic play important roles in the etiology of CRC. Both microRNA (miRNA) and DNA methylation belong to the scope of epigenetic and there are complex regulatory mechanisms within miRNA and DNA methylation. We compiled 71 CRC related genes and 134 CRC related miRNAs. Then we identified 417 feed forward loops (FFLs) and 37 feedback loops (FBLs) among these genes, miRNAs and transcription factors (TFs). We constructed a network of miRNAs and TFs mediation for CRC utilizing these FFLs and FBLs. Statistical tests proved that these FFLs were significantly enriched in the CRC comparing to the esophageal cancer, breast cancer and randomly selected CRCmiRNA-gene pairs. Analysis of the network singled out 3 core genes, 2 core miRNAs and 5 core TFs. The KEGG enrichment and GO enrichment for the 2 core miRNA target genes indicated that they were significantly enriched in CRC related pathways. (Ex. MARK pathway, TGFβ pathway and cell cycle) Through the investigation on methylation, we found that most of the CRC related genes and miRNAs were prone to be regulated by methylation. This study sheds lights on the regulatory mechanisms in CRC and we provide some insights on the epigenetic of CRC.