Evidence map›Paper›PMID 26227548›Full record

ArticleBMC bioinformatics2015

Simulated unbound structures for benchmarking of protein docking in the DOCKGROUND resource.

Tatsiana Kirys, Anatoly M Ruvinsky, Deepak Singla, Alexander V Tuzikov, Petras J Kundrotas, Ilya A Vakser

Open access · goldAbstract read
In one paragraph

Article in BMC bioinformatics, 2015. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.

0numbers the graph read from it
0cells of the map it votes in
5citing papers in PubMed
0.9field-weighted citation impact, top 26% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

5 citing papers in PubMed, 14 citations in OpenAlex.

  1. Dockground resource for protein recognition studies.Protein science : a publication of the Protein Society · 2022
    Article
  2. Article
  3. Article
  4. Article
  5. Dockground: A comprehensive data resource for modeling of protein complexes.Protein science : a publication of the Protein Society · 2018
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors at 2 institutions in 2 countries.

Tatsiana KirysCenter for Computational Biology, The University of Kansas, Lawrence, KS, 66047, USA. tatsiana.bylund@gmail.com.
Anatoly M RuvinskyCenter for Computational Biology, The University of Kansas, Lawrence, KS, 66047, USA. aruvinsky@yahoo.com.
Deepak SinglaCenter for Computational Biology, The University of Kansas, Lawrence, KS, 66047, USA. deepkumar1983@gmail.com.
Alexander V TuzikovUnited Institute of Informatics Problems, National Academy of Sciences, 220012, Minsk, Belarus. tuzikov@newman.bas-net.by.
Petras J KundrotasCenter for Computational Biology, The University of Kansas, Lawrence, KS, 66047, USA. pkundro@ku.edu.
Ilya A VakserCenter for Computational Biology, The University of Kansas, Lawrence, KS, 66047, USA. vakser@ku.edu.
University of Kansas · USUnited Institute of Informatics Problems · BY

Funding

Integrated Resource for Protein Recognition StudiesR01GM074255 · NIGMS · UNIVERSITY OF KANSAS LAWRENCE · PI VAKSER, ILYA · 2005 to 2024
$6.2M
NIGMS NIH HHS R01 GM074255NIGMS NIH HHS R01GM074255
6 · The paper itself

Abstract

backgroundProteins play an important role in biological processes in living organisms. Many protein functions are based on interaction with other proteins. The structural information is important for adequate description of these interactions. Sets of protein structures determined in both bound and unbound states are essential for benchmarking of the docking procedures. However, the number of such proteins in PDB is relatively small. A radical expansion of such sets is possible if the unbound structures are computationally simulated.

resultsThe DOCKGROUND public resource provides data to improve our understanding of protein-protein interactions and to assist in the development of better tools for structural modeling of protein complexes, such as docking algorithms and scoring functions. A large set of simulated unbound protein structures was generated from the bound structures. The modeling protocol was based on 1 ns Langevin dynamics simulation. The simulated structures were validated on the ensemble of experimentally determined unbound and bound structures. The set is intended for large scale benchmarking of docking algorithms and scoring functions.

conclusionsA radical expansion of the unbound protein docking benchmark set was achieved by simulating the unbound structures. The simulated unbound structures were selected according to criteria from systematic comparison of experimentally determined bound and unbound structures. The set is publicly available at http://dockground.compbio.ku.edu.

Indexed as

BenchmarkingComputer SimulationAlgorithmsBinding SitesComputational BiologyInternetMolecular Docking SimulationProtein Interaction Domains and MotifsProteinsProtein Structure, TertiaryUser-Computer InterfaceProteins

Identifiers

PMID26227548
PMCPMC4521349
OpenAlexW2097931415

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.