Evidence map›Paper›PMID 23282245›Full record

ArticleBMC bioinformatics2012

Sanjeevini: a freely accessible web-server for target directed lead molecule discovery.

B Jayaram, Tanya Singh, Goutam Mukherjee, Abhinav Mathur, Shashank Shekhar, Vandana Shekhar

Abstract read
In one paragraph

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

0numbers the graph read from it
0cells of the map it votes in
48citing 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

48 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Molecular Docking and Drug-Likeness ofCurrent issues in molecular biology · 2025
    Article
  8. Article
  9. Article
  10. Review
  11. Article
  12. Green synthesis of MnOVirology journal · 2024
    Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. 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.

B JayaramDepartment of Chemistry, Indian Institute of Technology, Hauz Khas, New Delhi-110016, India. bjayaram@chemistry.iitd.ac.in
Tanya Singh
Goutam Mukherjee
Abhinav Mathur
Shashank Shekhar
Vandana Shekhar

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundComputational methods utilizing the structural and functional information help to understand specific molecular recognition events between the target biomolecule and candidate hits and make it possible to design improved lead molecules for the target.

resultsSanjeevini represents a massive on-going scientific endeavor to provide to the user, a freely accessible state of the art software suite for protein and DNA targeted lead molecule discovery. It builds in several features, including automated detection of active sites, scanning against a million compound library for identifying hit molecules, all atom based docking and scoring and various other utilities to design molecules with desired affinity and specificity against biomolecular targets. Each of the modules is thoroughly validated on a large dataset of protein/DNA drug targets.

conclusionsThe article presents Sanjeevini, a freely accessible user friendly web-server, to aid in drug discovery. It is implemented on a tera flop cluster and made accessible via a web-interface at http://www.scfbio-iitd.res.in/sanjeevini/sanjeevini.jsp. A brief description of various modules, their scientific basis, validation, and how to use the server to develop in silico suggestions of lead molecules is provided.

Indexed as

InternetSoftwareDrug DiscoveryProteinsProteins

Identifiers

PMID23282245
PMCPMC3521208

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.