Evidence map›Paper›PMID 34071676›Full record

ArticleInternational journal of molecular sciences2021

VirtualFlow Ants-Ultra-Large Virtual Screenings with Artificial Intelligence Driven Docking Algorithm Based on Ant Colony Optimization.

Christoph Gorgulla, Süleyman Selim Çınaroğlu, Patrick D Fischer, Konstantin Fackeldey, Gerhard Wagner, Haribabu Arthanari

Open access · goldAbstract read
In one paragraph

Article in International journal of molecular sciences, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 10 papers.

0numbers the graph read from it
0cells of the map it votes in
10citing papers in PubMed
4.5field-weighted citation impact, top 5% 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

10 citing papers in PubMed, 35 citations in OpenAlex.

  1. Review
  2. Review
  3. Article
  4. Article
  5. DockOpt: A Tool for Automatic Optimization of Docking Models.Journal of chemical information and modeling · 2024
    Article
  6. Review
  7. Large-Scale Docking in the Cloud.Journal of chemical information and modeling · 2023
    Article
  8. Review
  9. Review
  10. 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 3 institutions in 3 countries.

Christoph GorgullaDepartment of Physics, Harvard University, Cambridge, MA 02138, USA.ORCID 0000-0001-6986-5270
Süleyman Selim ÇınaroğluDepartment of Biochemistry, University of Oxford, South Parks Road, Oxford OX1 3QU, UK.ORCID 0000-0001-7120-3540
Patrick D FischerDepartment of Biological Chemistry and Molecular Pharmacology, Harvard Medical School, Boston, MA 02115, USA.ORCID 0000-0003-4160-5295
Konstantin FackeldeyZuse Institute Berlin, 14195 Berlin, Germany.ORCID 0000-0002-4373-3672
Gerhard WagnerDepartment of Biological Chemistry and Molecular Pharmacology, Harvard Medical School, Boston, MA 02115, USA.ORCID 0000-0002-2063-4401
Haribabu ArthanariDepartment of Biological Chemistry and Molecular Pharmacology, Harvard Medical School, Boston, MA 02115, USA.ORCID 0000-0002-7281-1289
Harvard University · USUniversity of Oxford · GBZuse Institute Berlin · DE

Funding

STRUCTURE BASIS OF IMMUNE-CELL SURFACE RECEPTOR FUNCTIONR01AI037581 · NIAID · HARVARD UNIVERSITY (MEDICAL SCHOOL) · PI WAGNER, GERHARD · 1996 to 2021
$6.7M
CONTROL AND ACTIVATION OF THE TUMOR NECROSIS FACTOR RECEPTORSR01AI150709 · NIAID · HARVARD MEDICAL SCHOOL · PI WAGNER, GERHARD, WU, HAO · 2020 to 2024
$4.0M
Roles of Eukaryotic Translation Initiation Factors in Gene ExpressionR01CA200913 · NCI · HARVARD MEDICAL SCHOOL · PI WAGNER, GERHARD · 2016 to 2020
$2.3M
Next Generation Solution NMR Techniques for GPCR Structure, Dynamics and FunctionR01GM129026 · NIGMS · HARVARD MEDICAL SCHOOL · PI WAGNER, GERHARD · 2018 to 2021
$2.0M
NCI NIH HHS CA200913NIAID NIH HHS R01 AI037581NIAID NIH HHS R01 AI150709NIGMS NIH HHS GM129026NIGMS NIH HHS R01 GM129026
6 · The paper itself

Abstract

The docking program PLANTS, which is based on ant colony optimization (ACO) algorithm, has many advanced features for molecular docking. Among them are multiple scoring functions, the possibility to model explicit displaceable water molecules, and the inclusion of experimental constraints. Here, we add support of PLANTS to VirtualFlow (VirtualFlow Ants), which adds a valuable method for primary virtual screenings and rescoring procedures. Furthermore, we have added support of ligand libraries in the MOL2 format, as well as on the fly conversion of ligand libraries which are in the PDBQT format to the MOL2 format to endow VirtualFlow Ants with an increased flexibility regarding the ligand libraries. The on the fly conversion is carried out with Open Babel and the program SPORES. We applied VirtualFlow Ants to a test system involving KEAP1 on the Google Cloud up to 128,000 CPUs, and the observed scaling behavior is approximately linear. Furthermore, we have adjusted several central docking parameters of PLANTS (such as the speed parameter or the number of ants) and screened 10 million compounds for each of the 10 resulting docking scenarios. We analyzed their docking scores and average docking times, which are key factors in virtual screenings. The possibility of carrying out ultra-large virtual screening with PLANTS via VirtualFlow Ants opens new avenues in computational drug discovery.

Indexed as

AlgorithmsArtificial IntelligenceMolecular Docking SimulationComputational BiologyKelch-Like ECH-Associated Protein 1LigandsNF-E2-Related Factor 2Protein BindingProtein ConformationReproducibility of ResultsThermodynamicsKelch-Like ECH-Associated Protein 1LigandsNF-E2-Related Factor 2artificial intelligenceCADDcomputer aided drug designdrug discoveryKEAP1molecular dockingstructure based virtual screeningswarm intelligence

Identifiers

PMID34071676
PMCPMC8199267
OpenAlexW3165388098

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.