A nonredundant structure dataset for benchmarking protein‐RNA computational docking

@article{Huang2013ANS,
  title={A nonredundant structure dataset for benchmarking protein‐RNA computational docking},
  author={Shengyou Huang and X. Zou},
  journal={Journal of Computational Chemistry},
  year={2013},
  volume={34}
}
Protein–RNA interactions play an important role in many biological processes. The ability to predict the molecular structures of protein–RNA complexes from docking would be valuable for understanding the underlying chemical mechanisms. We have developed a novel nonredundant benchmark dataset for protein–RNA docking and scoring. The diverse dataset of 72 targets consists of 52 unbound–unbound test complexes, and 20 unbound–bound test complexes. Here, unbound–unbound complexes refer to cases in… Expand
RRDB: a comprehensive and non‐redundant benchmark for RNA‐RNA docking and scoring
TLDR
This work has developed the first comprehensive and nonredundant RNA‐RNA docking benchmark (RRDB), which will be beneficial for the development and optimization of docking and scoring algorithms for RNA‐ RNA interactions. Expand
Protein-ensemble-RNA docking by efficient consideration of protein flexibility through homology models
TLDR
A homology model-based ensemble docking approach to explicitly consider the protein flexibility in protein-RNA docking through an ensemble of multiple protein structures, which is referred to as MPRDock and will have a general application in molecular docking for other interactions. Expand
A non‐redundant protein–RNA docking benchmark version 2.0
TLDR
An updated version of the protein–RNA docking benchmark is presented, which should provide the docking community with more test cases for evaluating rigid‐body as well as flexible docking algorithms and facilitate the development of new algorithms that require large number of training set. Expand
A structure-based model for the prediction of protein-RNA binding affinity.
TLDR
A binding affinity dataset of 40 protein-RNA complexes, for which at least one unbound partner is available in the docking benchmark, is curated and the best fit model with the lowest maximum error is provided with three interface parameters: relative hydrophobicity, conformational change upon binding and relative hydration pattern. Expand
Protein-RNA Complexes and Efficient Automatic Docking: Expanding RosettaDock Possibilities
TLDR
This is the first approach that currently offers a multi-level optimized scoring approach integrated in a full docking suite, leading the way to adaptive fully flexible strategies. Expand
RBind: computational network method to predict RNA binding sites
TLDR
This work presents a network approach, RBind, to predict the RNA binding sites, and benchmarked RBind in RNA-ligand and RNA-protein datasets showed that it has a reliable accuracy for binding sites prediction. Expand
A knowledge-based scoring function for protein-RNA interactions derived from a statistical mechanics-based iterative method
TLDR
A knowledge-based scoring function, referred to as ITScore-PR, for protein-RNA binding mode prediction by using a statistical mechanics-based iterative method, which can be used stand-alone or easily implemented in other docking programs for protein–RNA recognition. Expand
A combinatorial scoring function for protein–RNA docking
TLDR
A knowledge‐based residue‐nucleotide pairwise potential with secondary structure information considered for nonribosomal protein–RNA docking and it was found that the long‐range electrostatic attractive energy plays an important role in distinguishing near‐native structures from the incorrect ones. Expand
PepPro: A Nonredundant Structure Data Set for Benchmarking Peptide–Protein Computational Docking
TLDR
A nonredundant benchmark, coined PepPro, for testing peptide–protein docking algorithms, which covers peptides with distinct secondary structures and can be used for testing the ability of a docking algorithm handling the conformational changes of proteins during the binding process. Expand
HDOCK: a web server for protein–protein and protein–DNA/RNA docking based on a hybrid strategy
TLDR
Tested on the cases with weakly homologous complexes of <30% sequence identity from five docking benchmarks, the HDOCK pipeline tied with template-based modeling on the protein–protein and protein–DNA benchmarks and performed better than template- based modelingon the three protein–RNA benchmarks when the top 10 predictions were considered. Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 80 REFERENCES
DOCKGROUND system of databases for protein recognition studies: Unbound structures for docking
TLDR
The main focus of the current release is unbound (experimental and simulated) protein–protein complexes, and the database contains comprehensive sets of complexes suitable for large scale benchmarking of docking algorithms. Expand
A structure‐based benchmark for protein–protein binding affinity
TLDR
A nonredundant set of 144 protein–protein complexes that have high‐resolution structures available for both the complexes and their unbound components, and for which dissociation constants have been measured by biophysical methods may be used to benchmark biophysical models aiming to relate affinity to structure in protein– protein interactions. Expand
Docking and scoring protein interactions: CAPRI 2009
TLDR
The ability of these algorithms to sample docking poses and to single out specific association modes in 14 targets, representing 11 distinct protein complexes, was evaluated, revealing that 67% of the groups, more than ever before, produced acceptable models or better for at least one target. Expand
Protein–protein docking benchmark version 4.0
TLDR
The protein–protein docking benchmark is updated to include complexes that became available since the previous release, and provides 176 unbound–unbound cases that can be used for protein– protein docking method development and assessment. Expand
A protein–protein docking benchmark
TLDR
A nonredundant benchmark for testing protein–protein docking algorithms and should benefit the docking community not only as a large curated test set but also as a common ground for comparing different algorithms. Expand
Assessment of CAPRI predictions in rounds 3–5 shows progress in docking procedures
TLDR
Results and a brief survey of the methods used by participants of CAPRI Rounds 3–5 suggest that genuine progress in the performance of docking methods is being achieved, with CAPRI acting as the catalyst. Expand
Protein–protein docking benchmark 2.0: An update
TLDR
A new version of the Protein–Protein Docking Benchmark is presented, reconstructed from the bottom up to include more complexes, particularly focusing on more unbound–unbound test cases, and provides a platform for evaluating the progress of docking methods on a wide variety of targets. Expand
CAPRI: A Critical Assessment of PRedicted Interactions
TLDR
The motivations for launching CAPRI, the rules that were applied to select targets and run the experiment, the results stress the need for new scoring functions and for methods handling the conformation changes that were observed in some of the target systems, and some conclusions can already be drawn. Expand
A protein–DNA docking benchmark
TLDR
A protein–DNA docking benchmark containing 47 unbound–unbound test cases of which 13 are classified as easy, 22 as intermediate and 12 as difficult cases, a useful tool for comparison and development of protein– DNA docking methods. Expand
Protein–protein docking benchmark version 3.0
TLDR
This update of Benchmark 3.0 includes 40 new test cases, representing a 48% increase from Benchmark 2.0, and will facilitate the development of new algorithms that require a large number of training examples. Expand
...
1
2
3
4
5
...