Evidence map›Paper›PMID 26561508›Full record

ArticleJournal of cheminformatics

A fast topological analysis algorithm for large-scale similarity evaluations of ligands and binding pockets.

Mohammad ElGamacy, Luc Van Meervelt

Abstract read
In one paragraph

Article in Journal of cheminformatics. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing papers in PubMed
–field-weighted citation impact
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

3 citing papers in PubMed.

  1. Review
  2. Article
  3. Recent Advances in In Silico Target Fishing.Molecules (Basel, Switzerland) · 2021
    Review
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

2 authors.

Mohammad ElGamacyDepartment of Protein Evolution, Max Planck Institute for Developmental Biology, 72076 Tübingen, Germany ; Biomolecular Architecture, Chemistry Department, KU Leuven, Celestijnenlaan 200F, box 2404, 3001 Leuven (Heverlee), Belgium.
Luc Van MeerveltBiomolecular Architecture, Chemistry Department, KU Leuven, Celestijnenlaan 200F, box 2404, 3001 Leuven (Heverlee), Belgium.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

motivationWith the rapid increase of the structural data of biomolecular complexes, novel structural analysis methods have to be devised with high-throughput capacity to handle immense data input and to construct massive networks at the minimal computational cost. Moreover, novel methods should be capable of handling a broad range of molecular structural sizes and chemical natures, cognisant of the conformational and electrostatic bases of molecular recognition, and sufficiently accurate to enable contextually relevant biological inferences.

resultsA novel molecular topology comparison method was developed and tested. The method was tested for both ligand and binding pocket similarity analyses and a PDB-wide ligand topological similarity map was computed.

conclusionThe unprecedentedly wide scope of ligand definition and large-scale topological similarity mapping can provide very robust tools, of performance unmatched by the present alignment-based methods. The method remarkably shows potential for application for scaffold hopping purposes. It also opens new frontiers in the areas of ligand-mediated protein connectivity, ligand-based molecular phylogeny, target fishing, and off-target predictions. Graphical abstract:A novel molecular topology comparison method based on a combined shape distribution and charge binning scheme is presented.

Indexed as

Binding pocket mappingLigand-based designTopology comparisonsVirtual high-throughput screening

Identifiers

PMID26561508
PMCPMC4631714

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.