Changhui Yan

Changhui Yan

Auto-generated profile, based on publicly available information

Changhui Yan

Department of Computer Science, Utah State University, Logan, UT 84322 U.S.A

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
13 September 2007 in The Protein Journal
Verified
Journal Article
Closed access
PDF file
CYChanghui Yan
Changhui Yan
FWFeihong Wu
Feihong Wu
RJRobert L. Jernigan
Robert L. Jernigan
DDDrena Dobbs
Drena Dobbs
VHVasant Honavar
Vasant Honavar

19 May 2006 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
CYChanghui Yan
Changhui Yan
MTMichael Terribilini
Michael Terribilini
FWFeihong Wu
Feihong Wu
Robert JerniganRobert Jernigan
Robert Jernigan
DDDrena Dobbs
Drena Dobbs
VHVasant Honavar
Vasant Honavar
Background: Understanding the molecular details of protein-DNA interactions is critical for deciphering the mechanisms of gene regulation. We present a machine learning approach for the identification of amino acid residues involved in protein-DNA interactions. Results: We start with a Naïve Bayes classifier trained to predict whether a given amino acid residue is a DNA-binding residue based on its identity and the identities of its sequence neighbors. The input to the classifier consists of the identities of the target residue and 4 sequence neighbors on each side of the target residue. The classifier is trained and evaluated (using leave-one-out cross-validation) on a non-redundant set of 171 proteins. Our results indicate the feasibility of identifying interface residues based on local sequence information. The classifier achieves 71% overall accuracy with a correlation coefficient of 0.24, 35% specificity and 53% sensitivity in identifying interface residues as evaluated by leave-one-out cross-validation. We show that the performance of the classifier is improved by using sequence entropy of the target residue (the entropy of the corresponding column in multiple alignment obtained by aligning the target sequence with its sequence homologs) as additional input. The classifier achieves 78% overall accuracy with a correlation coefficient of 0.28, 44% specificity and 41% sensitivity in identifying interface residues. Examination of the predictions in the context of 3-dimensional structures of proteins demonstrates the effectiveness of this method in identifying DNA-binding sites from sequence information. In 33% (56 out of 171) of the proteins, the classifier identifies the interaction sites by correctly recognizing at least half of the interface residues. In 87% (149 out of 171) of the proteins, the classifier correctly identifies at least 20% of the interface residues. This suggests the possibility of using such classifiers to identify potential DNA-binding motifs and to gain potentially useful insights into sequence correlates of protein-DNA interactions. Conclusion: Naïve Bayes classifiers trained to identify DNA-binding residues using sequence information offer a computationally efficient approach to identifying putative DNA-binding sites in DNA-binding proteins and recognizing potential DNA-binding motifs.

31 January 2008 in Bioinformatics and Biology Insights
Verified
Journal Article
Open access
JHJing Hu
Jing Hu
CYChanghui Yan
Changhui Yan
α-helical transmembrane (TM) proteins play important and diverse functional roles in cells. The ability to predict the topology of these proteins is important for identifying functional sites and inferring function of membrane proteins. This paper presents a Hidden Markov Model (referred to as HMM_RA) that can predict the topology of α-helical transmembrane proteins with improved performance. HMM_RA adopts the same structure as the HMMTOP method, which has five modules: inside loop, inside helix tail, membrane helix, outside helix tail and outside loop. Each module consists of one or multiple states. HMM_RA allows using reduced alphabets to encode protein sequences. Thus, each state of HMM_RA is associated with n emission probabilities, where n is the size of the reduced alphabet set. Direct comparisons using two standard data sets show that HMM_RA consistently outperforms HMMTOP and TMHMM in topology prediction. Specifically, on a high-quality data set of 83 proteins, HMM_RA outperforms HMMTOP by up to 7.6% in topology accuracy and 6.4% in α-helices location accuracy. On the same data set, HMM_RA outperforms TMHMM by up to 6.4% in topology accuracy and 2.9% in location accuracy. Comparison also shows that HMM_RA achieves comparable performance as Phobius, a recently published method.

1 October 2007
Verified
Conference Paper
Closed access
JHJing Hu
Jing Hu
CYChanghui Yan
Changhui Yan
Predicting subcellular localizations of proteins is very important for the determination of protein functions. In this paper, we present a K-nearest neighbor (K-NN) method for predicting the subcellular localizations of proteins in Gram-negative bacteria. The method makes predictions based on a weighted Euclidian distance computed from amino acid composition. The method achieves 81.4% accuracy in assigning proteins into five subcellular locations. Comparisons show that using the weighted Euclidian distance developed in this study can achieves better performance in predicting subcellular localization than using the standard Euclidian distance. We also compare our method with CELLO II, one of the best methods in subcellular localization prediction. The comparisons show the performances of the two methods are comparable, while our method is much simpler and faster.