The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
PrankWeb: a web server for ligand binding site prediction and visualization
Open accessAbstract
PrankWeb is an online resource providing an interface to P2Rank, a state-of-the-art method for ligand binding site prediction. P2Rank is a template-free machine learning method based on the prediction of local chemical neighborhood ligandability centered on points placed on a solvent-accessible protein surface. Points with a high ligandability score are then clustered to form the resulting ligand binding sites. In addition, PrankWeb provides a web interface enabling users to easily carry out the prediction and visually inspect the predicted binding sites via an integrated sequence-structure view. Moreover, PrankWeb can determine sequence conservation for the input molecule and use this in both the prediction and result visualization steps. Alongside its online visualization options, PrankWeb also offers the possibility of exporting the results as a PyMOL script for offline visualization. The web frontend communicates with the server side via a REST API. In high-throughput scenarios, therefore, users can utilize the server API directly, bypassing the need for a web-based frontend or installation of the P2Rank application. PrankWeb is available at http://prankweb.cz/, while the web application source code and the P2Rank method can be accessed at https://github.com/jendelel/PrankWebApp and https://github.com/rdk/p2rank, respectively.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Gapped BLAST and PSI-BLAST: a new generation of protein database search programs
Altschul, S. (1997) · Nucleic Acids Research · doi:10.1093/nar/25.17.3389 · Cited by 73,302
MUSCLE: multiple sequence alignment with high accuracy and high throughput
Edgar, R. C. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh340 · Cited by 44,662
Berman, H. M. (2000) · Nucleic Acids Research · doi:10.1093/nar/28.1.235 · Cited by 40,196
Cd-hit: a fast program for clustering and comparing large sets of protein or nucleotide sequences
Li, W., & Godzik, A. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl158 · Cited by 11,410
UniProt: a worldwide hub of protein knowledge
The UniProt Consortium (2019) · Nucleic Acids Research · doi:10.1093/nar/gky1049 · Cited by 7,698
Ho, T. K. (2002) · Proceedings of 3rd International Conference on Document Analysis and Recognition · doi:10.1109/icdar.1995.598994 · Cited by 5,054
A series of PDB related databases for everyday needs
Joosten, R. P., te Beek, T. A. H., Krieger, E., Hekkelman, M. L., Hooft, R. W. W., Schneider, R., Sander, C., & Vriend, G. (2011) · Nucleic Acids Research · doi:10.1093/nar/gkq1105 · Cited by 1,293
Yang, J., Roy, A., & Zhang, Y. (2013) · Bioinformatics · doi:10.1093/bioinformatics/btt447 · Cited by 1,035
DeepSite: protein-binding site predictor using 3D-convolutional neural networks
Jiménez, J., Doerr, S., Martínez-Rosell, G., Rose, A. S., & De Fabritiis, G. (2017) · Bioinformatics · doi:10.1093/bioinformatics/btx350 · Cited by 808
COFACTOR: an accurate comparative algorithm for structure-based protein function annotation
Roy, A., Yang, J., & Zhang, Y. (2012) · Nucleic Acids Research · doi:10.1093/nar/gks372 · Cited by 706
Predicting functionally important residues from sequence conservation
Capra, J. A., & Singh, M. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm270 · Cited by 691
3DLigandSite: predicting ligand-binding sites using similar structures
Wass, M. N., Kelley, L. A., & Sternberg, M. J. E. (2010) · Nucleic Acids Research · doi:10.1093/nar/gkq406 · Cited by 633
Zhang, C., Freddolino, L., & Zhang, Y. (2017) · Nucleic Acids Research · doi:10.1093/nar/gkx366 · Cited by 606
Krivák, R., & Hoksza, D. (2018) · Journal of Cheminformatics · doi:10.1186/s13321-018-0285-8 · Cited by 583
Self-citationNGL viewer: web-based molecular graphics for large complexes
Rose, A. S., Bradley, A. R., Valasatava, Y., Duarte, J. M., Prlić, A., & Rose, P. W. (2018) · Bioinformatics · doi:10.1093/bioinformatics/bty419 · Cited by 489
NGL Viewer: a web application for molecular visualization
Rose, A. S., & Hildebrand, P. W. (2015) · Nucleic Acids Research · doi:10.1093/nar/gkv402 · Cited by 462
Capra, J. A., Laskowski, R. A., Thornton, J. M., Singh, M., & Funkhouser, T. A. (2009) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000585 · Cited by 458
Roll: a new algorithm for the detection of protein pockets and cavities with a rolling probe sphere
Yu, J., Zhou, Y., Tanaka, I., & Yao, M. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btp599 · Cited by 397
Zhang, Z., Li, Y., Lin, B., Schroeder, M., & Huang, B. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btr331 · Cited by 332
Analyzing the Topology of Active Sites: On the Prediction of Pockets and Subpockets
Volkamer, A., Griewel, A., Grombacher, T., & Rarey, M. (2010) · Journal of Chemical Information and Modeling · doi:10.1021/ci100241y · Cited by 300
FTSite: high accuracy detection of ligand binding sites on unbound protein structures
Ngan, C.-H., Hall, D. R., Zerbe, B., Grove, L. E., Kozakov, D., & Vajda, S. (2012) · Bioinformatics · doi:10.1093/bioinformatics/btr651 · Cited by 292
fpocket: online tools for protein ensemble pocket detection and tracking
Schmidtke, P., Le Guilloux, V., Maupetit, J., & Tuffery, P. (2010) · Nucleic Acids Research · doi:10.1093/nar/gkq383 · Cited by 290
Hanson, R. M., Prilusky, J., Renjian, Z., Nakane, T., & Sussman, J. L. (2013) · Israel Journal of Chemistry · doi:10.1002/ijch.201300024 · Cited by 261
SITEHOUND-web: a server for ligand binding site identification in protein structures
Hernandez, M., Ghersi, D., & Sanchez, R. (2009) · Nucleic Acids Research · doi:10.1093/nar/gkp281 · Cited by 227
Structural genomics and its importance for gene function analysis
Skolnick, J., Fetrow, J. S., & Kolinski, A. (2000) · Nature Biotechnology · doi:10.1038/73723 · Cited by 226
LiteMol suite: interactive web-based visualization of large-scale macromolecular structure data
Sehnal, D., Deshpande, M., Vařeková, R. S., Mir, S., Berka, K., Midlik, A., Pravda, L., Velankar, S. S., & Koča, J. (2017) · Nature Methods · doi:10.1038/nmeth.4499 · Cited by 148
AstexViewerTM †: a visualisation aid for structure-based drug design
Hartshorn, M. J. (2002) · Journal of Computer-Aided Molecular Design · doi:10.1023/a:1023813504011 · Cited by 145
GalaxySite: ligand-binding-site prediction by using molecular docking
Heo, L., Shin, W., Lee, M. S., & Seok, C. (2014) · Nucleic Acids Research · doi:10.1093/nar/gku321 · Cited by 112
Chen, K., Mizianty, M. J., Gao, J., & Kurgan, L. (2011) · Structure · doi:10.1016/j.str.2011.02.015 · Cited by 92
Web-based molecular graphics for large complexes
Rose, A., Bradley, A. R., Valasatava, Y., Duarte, J. M., Prlić, A., & Rose, P. W. (2016) · international conference on 3D web technology · doi:10.1145/2945292.2945324 · Cited by 91
Feinstein, W. P., & Bryliński, M. (2014) · Molecular Informatics · doi:10.1002/minf.201300143 · Cited by 38
LIBRA-WA: a web application for ligand binding site detection and protein function recognition
Toti, D., Hung, L. V., Tortosa, V., Brandi, V., & Polticelli, F. (2017) · Bioinformatics · doi:10.1093/bioinformatics/btx715 · Cited by 33
Cited by
ProteinsPlus: interactive analysis of protein–ligand binding interfaces
Schöning-Stierand, K., Diedrich, K., Fährrolfes, R., Flachsenberg, F., Meyder, A., Nittinger, E., Steinegger, R., & Rarey, M. (2020) · Nucleic Acids Research · doi:10.1093/nar/gkaa235 · Cited by 273
Dhakal, A., McKay, C., Tanner, J. J., & Cheng, J. (2022) · Briefings in Bioinformatics · doi:10.1093/bib/bbab476 · Cited by 256
Smith, Z., Strobel, M., Vani, B. P., & Tiwary, P. (2024) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.3c01698 · Cited by 47
eEF2K Inhibitor Design: The Progression of Exemplary Structure-Based Drug Design
Klupt, K. A., & Jia, Z. (2023) · Molecules · doi:10.3390/molecules28031095 · Cited by 11
Canonical and Alternative Auxin Signaling Systems in Mono-, Di-, and Tetraploid Potatoes
Lomin, S. N., Kolachevskaya, O. O., Arkhipov, D. V., & Romanov, G. A. (2023) · International Journal of Molecular Sciences · doi:10.3390/ijms241411408 · Cited by 3
Metadata
- Authors
- Jendele, L., Krivak, R., Skoda, P., Novotny, M., & Hoksza, D.
- Venue
- Nucleic Acids Research
- Publisher
- Oxford University Press (OUP)
- Published
- 2019-05-22
- Volume
- 47
- Issue
- W1
- Pages
- W345-W349
- ISSN
- 0305-1048 (ISSN-L)
- 1362-4962
- OpenAlex
- W2950200056
- Cited by
- 529
- References
- 32
- FWCI
- 23.08
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.