Demo Data from VLDB 2026 / reviewers in the wild / expert
Bin Pang 0001
dblp:43/2499-1
· DBLP profile ↗
5ranked-venue papers
3as first author
0since 2021 · last 2015
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 5 · 3 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 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › protein structure analysis › protein binding site analysis
protein binding site comparison |
0.1 | 1 | 2012 | Fast protein binding site comparisons using visual words representation · Bioinform. 2012 |
Bioinformatics and computational biology
protein structure analysis |
0.1 | 1 | 2012 | Fast protein binding site comparisons using visual words representation · Bioinform. 2012 |
Bioinformatics and computational biology › protein structure prediction › template-based modeling
fold recognition |
0.1 | 1 | 2009 | Efficient SCOP-fold classification and retrieval using index-based protein substructure alignments · Bioinform. 2009 |
Bioinformatics and computational biology › protein structure analysis
protein structure alignment |
0.1 | 1 | 2009 | Efficient SCOP-fold classification and retrieval using index-based protein substructure alignments · Bioinform. 2009 |
Bioinformatics and computational biology › structural bioinformatics
protein structure classification |
0.1 | 1 | 2009 | Efficient SCOP-fold classification and retrieval using index-based protein substructure alignments · Bioinform. 2009 |
Bioinformatics and computational biology
protein function prediction |
0.0 | 1 | 2012 | Fast protein binding site comparisons using visual words representation · Bioinform. 2012 |
Methods — techniques the papers use, named apart from their topics
visual words · 0.1metric space operations · 0.1clustering · 0.1two-layer indexing tree · 0.1index-based alignment · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | An Integrated Approach to Sequence-Independent Local Alignment of Protein Binding SitesabstractAccurate alignment of protein-protein binding sites can aid in protein docking studies and constructing templates for predicting structure of protein complexes, along with in-depth understanding of evolutionary and functional relationships. However, over the past three decades, structural alignment algorithms have focused predominantly on global alignments with little effort on the alignment of local interfaces. In this paper, we introduce the PBSalign (Protein-protein Binding Site alignment) method, which integrates techniques in graph theory, 3D localized shape analysis, geometric scoring, and utilization of physicochemical and geometrical properties. Computational results demonstrate that PBSalign is capable of identifying similar homologous and analogous binding sites accurately and performing alignments with better geometric match measures than existing protein-protein interface comparison tools. The proportion of better alignment quality generated by PBSalign is 46, 56, and 70 percent more than iAlign as judged by the average match index (MI), similarity index (SI), and structural alignment score (SAS), respectively. PBSalign provides the life science community an efficient and accurate solution to binding-site alignment while striking the balance between topological details and computational complexity. Bin Pang 0001, David Schlessman, Xingyan Kuang, Nan Zhao 0002, Daniel Shyu, Dmitry Korkin, Chi-Ren Shyu |
IEEE ACM Trans. Comput. Biol. Bioinform. | 1 |
| 2013 | PBSalign: Sequence-independent local alignment of protein binding sitesabstractAccurate alignment of protein-protein binding sites can aid in protein docking studies and constructing templates for predicting structure of protein complexes, along with in-depth understanding of evolutionary and functional relationships. However, over the past three decades, structural alignment algorithms have focused predominantly on global alignments with little effort on the alignment of local interfaces. In this paper, we introduce the PBSalign (Protein-protein Binding Site alignment) method, which integrates techniques in graph theory, 3D localized shape analysis, geometric scoring, and utilization of physiochemical and geometrical properties. Computational results demonstrate that PBSalign is capable of identifying similar homologous and analogous binding sites accurately and performing alignments with better geometric match measures than existing protein-protein interface comparison tools. The proportion of better alignment quality generated by PBSalign is 46%, 56%, and 70% more than Align as judged by the average match index (MI), similarity index (SI), and structural alignment score (SAS), respectively. PBSalign provides the life science community a fast and accurate solution to binding-site alignment while striking the balance between topological details and computational complexity. Bin Pang 0001, David Schlessman, Xingyan Kuang, Nan Zhao 0002, Daniel Shyu, Dmitry Korkin, Chi-Ren Shyu |
BIBM | 1 |
| 2012 | Fast protein binding site comparisons using visual words representationabstractMOTIVATION: Finding geometrically similar protein binding sites is crucial for understanding protein functions and can provide valuable information for protein-protein docking and drug discovery. As the number of known protein-protein interaction structures has dramatically increased, a high-throughput and accurate protein binding site comparison method is essential. Traditional alignment-based methods can provide accurate correspondence between the binding sites but are computationally expensive. RESULTS: In this article, we present a novel method for the comparisons of protein binding sites using a 'visual words' representation (PBSword). We first extract geometric features of binding site surfaces and build a vocabulary of visual words by clustering a large set of feature descriptors. We then describe a binding site surface with a high-dimensional vector that encodes the frequency of visual words, enhanced by the spatial relationships among them. Finally, we measure the similarity of binding sites by utilizing metric space operations, which provide speedy comparisons between protein binding sites. Our experimental results show that PBSword achieves a comparable classification accuracy to an alignment-based method and improves accuracy of a feature-based method by 36% on a non-redundant dataset. PBSword also exhibits a significant efficiency improvement over an alignment-based method. Bin Pang 0001, Nan Zhao 0002, Dmitry Korkin, Chi-Ren Shyu |
Bioinform. | 1 |
| 2010 | An accurate classification of native and non-native protein-protein interactions using supervised and semi-supervised learning approachesabstractThe progress in experimental and computational structural biology has led to a rapid growth of experimentally resolved structures and computational models of protein-protein interactions. However, distinguishing between the physiological and non-physiological interactions remains a challenging problem. In this work, two related problems of interface classification have been addressed. The first problem is concerned with classification of the physiological and crystal-packing interactions. The second problem deals with the classification of the physiological interactions, or their accurate models, and decoys obtained from the inaccurate docking models. We have defined a universal set of interface features and employed supervised and semi-supervised learning approaches to accurately classify the interactions in both problems. Furthermore, we formulated the second problem as a semi-supervised learning problem and employed a transductive SVM to improve the accuracy of classification. Finally, we showed that using the scoring functions from the obtained classifiers, one can improve the accuracy of the docking methods. Nan Zhao 0002, Bin Pang 0001, Chi-Ren Shyu, Dmitry Korkin |
BIBM | 2 |
| 2009 | Efficient SCOP-fold classification and retrieval using index-based protein substructure alignmentsabstractMOTIVATION: To investigate structure-function relationships, life sciences researchers usually retrieve and classify proteins with similar substructures into the same fold. A manually constructed database, SCOP, is believed to be highly accurate; however, it is labor intensive. Another known method, DALI, is also precise but computationally expensive. We have developed an efficient algorithm, namely, index-based protein substructure alignment (IPSA), for protein-fold classification. IPSA constructs a two-layer indexing tree to quickly retrieve similar substructures in proteins and suggests possible folds by aligning these substructures. RESULTS: Compared with known algorithms, such as DALI, CE, MultiProt and MAMMOTH, on a sample dataset of non-redundant proteins from SCOP v1.73, IPSA exhibits an efficiency improvement of 53.10, 16.87, 3.60 and 1.64 times speedup, respectively. Evaluated on three different datasets of non-redundant proteins from SCOP, average accuracy of IPSA is approximately equal to DALI and better than CE, MAMMOTH, MultiProt and SSM. With reliable accuracy and efficiency, this work will benefit the study of high-throughput protein structure-function relationships. AVAILABILITY: IPSA is publicly accessible at http://ProteinDBS.rnet.missouri.edu/IPSA.php Pin-Hao Chi, Bin Pang 0001, Dmitry Korkin, Chi-Ren Shyu |
Bioinform. | 2 |