Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Weiwei Tong

dblp:06/1284 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2

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 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › protein structure prediction › protein-protein docking
FFT-based docking
0.112005
M-ZDOCK: a grid-based approach for Cn symmetric multimer docking · Bioinform. 2005
Bioinformatics and computational biology › protein structure prediction
protein-protein docking
0.112005
M-ZDOCK: a grid-based approach for Cn symmetric multimer docking · Bioinform. 2005
Bioinformatics and computational biology
structural bioinformatics
0.112005
M-ZDOCK: a grid-based approach for Cn symmetric multimer docking · Bioinform. 2005
Bioinformatics and computational biology
immunoinformatics
0.012003
Examining the independent binding assumption for binding of peptide epitopes to MHC-I molecules · Bioinform. 2003

Methods — techniques the papers use, named apart from their topics

grid-based search · 0.1fast fourier transform · 0.1scoring matrix · 0.0pair coefficients · 0.0artificial neural network · 0.0
YearPublicationVenuePosition
2005 M-ZDOCK: a grid-based approach for Cn symmetric multimer docking
abstract
UNLABELLED: Computational protein docking is a useful technique for gaining insights into protein interactions. We have developed an algorithm M-ZDOCK for predicting the structure of cyclically symmetric (Cn) multimers based on the structure of an unbound (or partially bound) monomer. Using a grid-based Fast Fourier Transform approach, a space of exclusively symmetric multimers is searched for the best structure. This leads to improvements both in accuracy and running time over the alternative, which is to run a binary docking program ZDOCK and filter the results for near-symmetry. The accuracy is improved because fewer false positives are considered in the search, thus hits are not as easily overlooked. By searching four instead of six degrees of freedom, the required amount of computation is reduced. This program has been tested on several known multimer complexes from the Protein DataBank, including four unbound multimers: three trimers and a pentamer. For all of these cases, M-ZDOCK was able to find at least one hit, whereas only two of the four testcases had hits when using ZDOCK and a symmetry filter. In addition, the running times are 30-40% faster for M-ZDOCK. AVAILABILITY: M-ZDOCK is freely available to academic users at http://zlab.bu.edu/m-zdock/ CONTACT: [email protected] SUPPLEMENTARY INFORMATION: http://zlab.bu.edu/m-zdock.
Brian G. Pierce, Weiwei Tong, Zhiping Weng
Bioinform.2
2003 Examining the independent binding assumption for binding of peptide epitopes to MHC-I molecules
abstract
MOTIVATION: Various methods have been proposed to predict the binding affinities of peptides to Major Histocompatibility Complex class I (MHC-I) molecules based on experimental binding data. They can be classified into two groups: (1) AIB methods that assume independent contributions of all peptide positions to the binding to MHC-I molecule (e.g. scoring matrices) and (2) general methods which can take into account interactions between different positions (e.g. artificial neural networks). We aim to compare the prediction accuracies of these methods, and quantify the impact of interactions between peptide positions. RESULTS: We compared several previously published and widely used methods and discovered that the best AIB methods gave significantly better predictions than three previously published general methods, possibly due to the lack of a sufficient training data for the general methods. The best results, however, were achieved with our newly developed general method, which combined a matrix describing independent binding with pair coefficients describing pair-wise interactions between peptide positions. The pair coefficients consistently but only slightly improved prediction accuracy, and were much smaller than the matrix entries. This explains why neglecting them-as is done in AIB methods-can still lead to good predictions. AVAILABILITY: The new prediction model is implemented at http://zlab.bu.edu/SMM. The underlying matrix and pair coefficients are also available as supplementary materials.
Björn Peters, Weiwei Tong, John Sidney, Alessandro Sette, Zhiping Weng
Bioinform.2