Bo Song

Bo Song

Auto-generated profile, based on publicly available information

Bo Song

College of Computing and Informatics, Drexel University, Philadelphia, PA, USA

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
25 May 2020 in IEEE Transactions on Nanobioscience
Verified
Journal Article
Closed access
JGJianliang Gao
Jianliang Gao
LTLing Tian
Ling Tian
JWJianxin Wang
Jianxin Wang
YCYibo Chen
Yibo Chen
BSBo Song
Bo Song
XHXiaohua Hu
Xiaohua Hu
Studying the similarity of diseases can help us to explore the pathological characteristics of complex diseases, and help provide reliable reference information for inferring the relationship between new diseases and known diseases, so as to develop effective treatment plans. To obtain the similarity of the disease, most previous methods either use a single similarity metric such as semantic score, functional score from single data source, or utilize weighting coefficients to simply combine multiple metrics with different dimensions. In this paper, we proposes a method to predict the similarity of diseases by node representation learning. We first integrate the semantic score and topological score between diseases by combining multiple data sources. Then for each disease, its integrated scores with all other diseases are utilized to map it into a vector of the same spatial dimension, and the vectors are used to measure and comprehensively analyze the similarity between diseases. Lastly, we conduct comparative experiment based on benchmark set and other disease nodes outside the benchmark set. Using the statistics such as average, variance, and coefficient of variation in the benchmark set to evaluate multiple methods demonstrates the effectiveness of our approach in the prediction of similar diseases.

27 August 2019 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
JGJianliang Gao
Jianliang Gao
LTLing Tian
Ling Tian
TLTengfei Lv
Tengfei Lv
JWJianxin Wang
Jianxin Wang
BSBo Song
Bo Song
XHXiaohua Hu
Xiaohua Hu
Research of Protein-Protein Interaction (PPI) Network Alignment is playing an important role in understanding the crucial underlying biological knowledge such as functionally homologous proteins and conserved evolutionary pathways across different species. In this paper, we propose a novel alignment method to map only those proteins with the most similarity throughout the PPI networks of multiple species. For the similarity features of the protein in the networks, we integrate both topological features with biological characteristics to provide enhanced supports for the alignment procedures. For topological features, we propose to apply a representation learning method on the networks that can generate a low dimensional vector embedding with its surrounding structural features for each protein. The topological similarity of proteins from different PPI networks can thus be transferred as the similarity of their corresponding vector representations, which provides a new way to comprehensively quantify the topological similarities between proteins. We also propose a new measure for the topological evaluation of the alignment results which better uncover the structural quality of the alignment across multiple networks. Both biological and topological evaluations on the alignment results of real datasets demonstrate our approach is promising and preferable against the previous multiple alignment methods.

18 May 2017 in IEEE Transactions on Nanobioscience
Verified
Journal Article
Open access
JGJianliang Gao
Jianliang Gao
BSBo Song
Bo Song
WKWeimao Ke
Weimao Ke
XHXiaohua Hu
Xiaohua Hu
Coverage and consistency are two most considered metrics to evaluate the effectiveness of network alignment. But they are a pair of contradictory evaluation metrics in protein-protein interaction (PPI) network alignment. It is difficult, if not impossible, to achieve high coverage and consistency simultaneously. Furthermore, existing methods of multiple PPI network alignment mostly ignore k-coverage or k-consistency, where k indicates the number of aligned species. In this paper, we propose BalanceAli, a novel approach for global alignment of multiple PPI networks that achieves high k-coverage and k-consistency simultaneously. With six data sets consisting of various numbers of PPI networks from five species, we evaluate the experimental results using different k values. The performance evaluations of our approach against other three state-of-the-art methods demonstrate the preferable comprehensive strength of our approach.

13 August 2018 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
JGJianliang Gao
Jianliang Gao
BSBo Song
Bo Song
XHXiaohua Hu
Xiaohua Hu
FYFengxia Yan
Fengxia Yan
JWJianxin Wang
Jianxin Wang
In bioinformatics, network alignment algorithms have been applied to protein-protein interaction (PPI) networks to discover evolutionary conserved substructures at the system level. However, most previous methods aim to maximize the similarity of aligned proteins in pairwise networks, while concerning little about the feature of connectivity in these substructures, such as the protein complexes. In this paper, we identify the problem of finding conserved protein complexes, which requires the aligned proteins in a PPI network to form a connected subnetwork. By taking the feature of connectivity into consideration, we propose ConnectedAlign, an efficient method to find conserved protein complexes from multiple PPI networks. The proposed method improves the coverage significantly without compromising of the consistency in the aligned results. In this way, the knowledge of protein complexes in well-studied species can be extended to that of poor-studied species. We conducted extensive experiments on real PPI networks of four species, including human, yeast, fruit fly and worm. The experimental results demonstrate dominant benefits of the proposed method in finding protein complexes across multiple species.

16 July 2021
Verified
Thesis
Closed access
BSBo Song
Bo Song
ASAhmet Sacan
Ahmet Sacan
EPElisabeth S. Papazoglou
Elisabeth S. Papazoglou
Chronic wounds are a global, ongoing health challenge that afflicts a large number of people. Effective diagnosis and treatment of the wounds relies largely on a precise identification and measurement of the wounded tissue; however, in current clinical process, wound evaluation is based on subjective visual inspection and manual measurements which are often inaccurate. An automatic computer-based system for fast and accurate segmentation and identification of wounds is desirable, both from the standpoint of improving health outcomes in chronic wound care and management, and in making clinical practice more efficient and cost-effective. As presented in this thesis, we design such a system that uses color wound photographs taken from the patients, and is capable of automatic image segmentation and wound region identification. Several commonly used segmentation methods are utilized to obtain a collection of candidate wound areas. The parameters of each method are fine-tuned through an optimization procedure. Two different types of Artificial Neural Networks (ANNs), the Multi-Layer Perceptron (MLP) and the Radial Basis Function (RBF) with parameters decided by a cross-validation approach, are then applied with supervised learning in the prediction procedure, and their results are compared. Satisfactory results of this system suggest a promising tool to assist in the field of clinical wound evaluation.

6 July 2021
Verified
Thesis
Closed access
BSBo Song
Bo Song
XHXiaohua Hu
Xiaohua Hu
WKWeimao Ke
Weimao Ke
The amount of available data has experienced significant growth as the result of technology advances in this era of Big Data. The biomedical domain, in particular, is one exemplar field where the number and scale of data sources have increased exponentially in the last decade. They are expected to keep growing even more rapidly to reach the level of Zetta bytes per year in the following year very soon. While more data obtained from advanced biotechnologies, such as high-throughput sequencing that encodes valuable information, are becoming overwhelmed, to discover knowledge from which for biology and medical research is still facing challenging problems with existing approaches. We study in this dissertation how to effectively and efficiently utilize these large-scare data from different numbers and types of sources for biomedical knowledge discovery. Raw data from biological organism such as microbiome usually have intrinsic high dimensionality of the feature space, which inevitably and exponentially raises the computational complexity of existing algorithms. We proposed a new approach using spectral interpolation technique to represent the high-dimensional data in low dimension space that not only greatly improves the efficiency of computing large-scale data but also preserves as much information as possible from original data. The resulting preferable outcomes for clustering and visualization tasks better facilitate the knowledge revealing of patterns and insights for microbial communities. We further studied how to enhance knowledge discovery while more than one data sources are available. Large-scale relational data such as protein-protein interactions (PPI) can be constructed in the form of network to invoke a system-wide perspective than traditional mechanistic approaches to interpret complex biological processes and functionalities. While bio-experiments are exhausted and costly, with two or more networks from different data sources we can apply computational comparative analysis such as Network Alignment to bridge the knowledge between well-studied species and under-examined species. We proposed new methods to globally align multiple large-scale biological networks from different species at the same time. We utilize both topological features and biological features of PPI networks and search heuristically for the best results. Representation learning for network is also integrated into our proposed framework to provide a new way to quantify the structural features of a node with its surrounding topology for the node embedding. The real data experiments showed promising results in finding homologous proteins as well as conserved protein complexes in poor-studied species for knowledge transferring from well-studied species. Besides utilizing homogeneous data from one and more data sources of one type, we keep exploring the possibility of harnessing sources of different types to take advantage of their underlying relational knowledge across heterogeneous data and capture the complex biomedical associations. The heterogeneous disease information networks we formulated in one research include types of sources from disease, pathway, and chemicals. They are filtered and calculated using Dynamic Time Warping (DTW) algorithm and meta path method for topological and semantics scores which lead to effective measurement of the similarity of diseases. In another study, we proposed a novel framework with Graph Convolutional Network to identify and predict disease-RNAs associations to better support the discovery of relational knowledge at the molecular level for medical applications such as disease diagnosis, therapy, and monitoring.