Young-Rae Cho

Prof. Young-Rae Cho

Computer & Telecommunication Engineering Division,Yonsei University, Wonju 26493, Korea
orcid

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
24 July 2007 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
YCYoung-Rae Cho
Young-Rae Cho
WHWoochang Hwang
Woochang Hwang
MRMurali Ramanathan
Murali Ramanathan
AZAidong Zhang
Aidong Zhang
The systematic analysis of protein-protein interactions can enable a better understanding of cellular organization, processes and functions. Functional modules can be identified from the protein interaction networks derived from experimental data sets. However, these analyses are challenging because of the presence of unreliable interactions and the complex connectivity of the network. The integration of protein-protein interactions with the data from other sources can be leveraged for improving the effectiveness of functional module detection algorithms. We have developed novel metrics, called semantic similarity and semantic interactivity, which use Gene Ontology (GO) annotations to measure the reliability of protein-protein interactions. The protein interaction networks can be converted into a weighted graph representation by assigning the reliability values to each interaction as a weight. We presented a flow-based modularization algorithm to efficiently identify overlapping modules in the weighted interaction networks. The experimental results show that the semantic similarity and semantic interactivity of interacting pairs were positively correlated with functional co-occurrence. The effectiveness of the algorithm for identifying modules was evaluated using functional categories from the MIPS database. We demonstrated that our algorithm had higher accuracy compared to other competing approaches. The integration of protein interaction networks with GO annotation data and the capability of detecting overlapping modules substantially improve the accuracy of module identification.

5 December 2006 in Algorithms for Molecular Biology
Verified
Journal Article
Open access
WHWoochang Hwang
Woochang Hwang
YCYoung-Rae Cho
Young-Rae Cho
AZAidong Zhang
Aidong Zhang
MRMurali Ramanathan
Murali Ramanathan
The sparse connectivity of protein-protein interaction data sets makes identification of functional modules challenging. The purpose of this study is to critically evaluate a novel clustering technique for clustering and detecting functional modules in protein-protein interaction networks, termed STM. STM selects representative proteins for each cluster and iteratively refines clusters based on a combination of the signal transduced and graph topology. STM is found to be effective at detecting clusters with a diverse range of interaction structures that are significant on measures of biological relevance. The STM approach is compared to six competing approaches including the maximum clique, quasi-clique, minimum cut, betweeness cut and Markov Clustering (MCL) algorithms. The clusters obtained by each technique are compared for enrichment of biological function. STM generates larger clusters and the clusters identified have p-values that are approximately 125-fold better than the other methods on biological function. An important strength of STM is that the percentage of proteins that are discarded to create clusters is much lower than the other approaches. STM outperforms competing approaches and is capable of effectively detecting both densely and sparsely connected, biologically relevant functional modules with fewer discards.

1 July 2020 in Methods
Verified
Journal Article
Closed access
YCYoung-Rae Cho
Young-Rae Cho
MKMingon Kang
Mingon Kang

25 July 2011 in Proteomics
Verified
Journal Article
Closed access
PDF file
EKEdward Casey Kenley
Edward Casey Kenley
YCYoung-Rae Cho
Young-Rae Cho

1 January 2013 in Proteome Science
Verified
Journal Article
Open access
PDF file
YCYoung-Rae Cho
Young-Rae Cho
MMMarco Mina
Marco Mina
YLYanxin Lu
Yanxin Lu
NKNayoung Kwon
Nayoung Kwon
Pietro Hiram GuzziPietro Hiram Guzzi
Pietro Hiram Guzzi
Protein-protein interactions (PPIs) play a key role in understanding the mechanisms of cellular processes. The availability of interactome data has catalyzed the development of computational approaches to elucidate functional behaviors of proteins on a system level. Gene Ontology (GO) and its annotations are a significant resource for functional characterization of proteins. Because of wide coverage, GO data have often been adopted as a benchmark for protein function prediction on the genomic scale.

Verified
Journal Article
Open access
PDF file
YKYoonbee Kim
Yoonbee Kim
JPJong-Hoon Park
Jong-Hoon Park
YCYoung-Rae Cho
Young-Rae Cho
Genome-wide association studies (GWAS) can be used to infer genome intervals that are involved in genetic diseases. However, investigating a large number of putative mutations for GWAS is resource- and time-intensive. Network-based computational approaches are being used for efficient disease-gene association prediction. Network-based methods are based on the underlying assumption that the genes causing the same diseases are located close to each other in a molecular network, such as a protein-protein interaction (PPI) network. In this survey, we provide an overview of network-based disease-gene association prediction methods based on three categories: graph-theoretic algorithms, machine learning algorithms, and an integration of these two. We experimented with six selected methods to compare their prediction performance using a heterogeneous network constructed by combining a genome-wide weighted PPI network, an ontology-based disease network, and disease-gene associations. The experiment was conducted in two different settings according to the presence and absence of known disease-associated genes. The results revealed that HerGePred, an integrative method, outperformed in the presence of known disease-associated genes, whereas PRINCE, which adopted a network propagation algorithm, was the most competitive in the absence of known disease-associated genes. Overall, the results demonstrated that the integrative methods performed better than the methods using graph-theory only, and the methods using a heterogeneous network performed better than those using a homogeneous PPI network only.