Database Commons a catalog of biological databases

Database Commons - PoSSuM

PoSSuM

Citations: 24

z-index 3.96

Short name PoSSuM
Full name Pocket Similarity Search using Multiple-Sketches
Description PoSSuM is useful for predicting the binding ligand for unbound structures, which provides important clues for characterizing protein structures with unclear functions.
URL http://possum.cbrc.jp/PoSSuM/
Year founded 2011
Last update & version 2014-10-15    v2.0
Availability Free to academic users only
University/Institution hosted National Institute of Biomedical Innovation
Address 7-6-8 Saito-Asagi, Ibaraki, Osaka 567-0085,Japan
City Osaka
Province/State
Country/Region Japan
Contact name Kentaro Tomii
Contact email k-tomii@aist.go.jp
Data type(s)
Major organism(s)
Keyword(s)
  • ligand-binding site
Publication(s)
  • PoSSuM v.2.0: data update and a new function for investigating ligand analogs and target proteins of small-molecule drugs. [PMID: 25404129]

    Jun-ichi Ito, Kazuyoshi Ikeda, Kazunori Yamada, Kenji Mizuguchi, Kentaro Tomii
    Nucleic acids research 2015:43(Database issue)
    6 Citations (Google Scholar as of 2016-08-17)

    Abstract: PoSSuM (http://possum.cbrc.jp/PoSSuM/) is a database for detecting similar small-molecule binding sites on proteins. Since its initial release in 2011, PoSSuM has grown to provide information related to 49 million pairs of similar binding sites discovered among 5.5 million known and putative binding sites. This enlargement of the database is expected to enhance opportunities for biological and pharmaceutical applications, such as predictions of new functions and drug discovery. In this release, we have provided a new service named PoSSuM drug search (PoSSuMds) at http://possum.cbrc.jp/PoSSuM/drug_search/, in which we selected 194 approved drug compounds retrieved from ChEMBL, and detected their known binding pockets and pockets that are similar to them. Users can access and download all of the search results via a new web interface, which is useful for finding ligand analogs as well as potential target proteins. Furthermore, PoSSuMds enables users to explore the binding pocket universe within PoSSuM. Additionally, we have improved the web interface with new functions, including sortable tables and a viewer for visualizing and downloading superimposed pockets. © The Author(s) 2014. Published by Oxford University Press on behalf of Nucleic Acids Research.

  • PoSSuM: a database of similar protein-ligand binding and putative pockets. [PMID: 22135290]

    Jun-Ichi Ito, Yasuo Tabei, Kana Shimizu, Koji Tsuda, Kentaro Tomii
    Nucleic acids research 2012:40(Database issue)
    18 Citations (Google Scholar as of 2016-01-19)

    Abstract: Numerous potential ligand-binding sites are available today, along with hundreds of thousands of known binding sites observed in the PDB. Exhaustive similarity search for such vastly numerous binding site pairs is useful to predict protein functions and to enable rapid screening of target proteins for drug design. Existing databases of ligand-binding sites offer databases of limited scale. For example, SitesBase covers only ~33,000 known binding sites. Inferring protein function and drug discovery purposes, however, demands a much more comprehensive database including known and putative-binding sites. Using a novel algorithm, we conducted a large-scale all-pairs similarity search for 1.8 million known and potential binding sites in the PDB, and discovered over 14 million similar pairs of binding sites. Here, we present the results as a relational database Pocket Similarity Search using Multiple-sketches (PoSSuM) including all the discovered pairs with annotations of various types. PoSSuM enables rapid exploration of similar binding sites among structures with different global folds as well as similar ones. Moreover, PoSSuM is useful for predicting the binding ligand for unbound structures, which provides important clues for characterizing protein structures with unclear functions. The PoSSuM database is freely available at http://possum.cbrc.jp/PoSSuM/.

Community reviews

Data
quality & quantity
Content organization & presentation
System accessibility & reliability
Reviewed by

Word cloud (embeddable)

Database Commons - Word Cloud

Accessibility

Rate of accessibility:
HTTP status codeDate requested
200 OK2018-11-20
200 OK2018-11-16
200 OK2018-11-13
200 OK2018-11-09
200 OK2018-11-06
200 OK2018-11-02
200 OK2018-10-30
200 OK2018-10-26
200 OK2018-10-23
200 OK2018-10-19
200 OK2018-10-16
200 OK2018-10-12
200 OK2018-10-09
200 OK2018-10-05
200 OK2018-10-02
200 OK2018-09-28
200 OK2018-09-25
-1 Failed2018-09-21
200 OK2018-09-18
200 OK2018-09-14
200 OK2018-09-11
200 OK2018-09-07
200 OK2018-09-04
200 OK2018-08-31
200 OK2018-08-28
200 OK2018-08-24
200 OK2018-08-21
200 OK2018-08-17
200 OK2018-08-14
200 OK2018-08-10
200 OK2018-08-07
200 OK2018-08-03
200 OK2018-07-31
200 OK2018-07-27
200 OK2018-07-24
200 OK2018-07-20
200 OK2018-07-17
200 OK2018-07-13
200 OK2018-07-10
200 OK2018-07-06
200 OK2018-07-03
200 OK2018-06-29
200 OK2018-06-26
200 OK2018-06-22
200 OK2018-06-19
200 OK2018-06-15
200 OK2018-06-12
200 OK2018-06-08
200 OK2018-06-05
200 OK2018-06-01
200 OK2018-05-29
200 OK2018-05-25
200 OK2018-05-22
200 OK2018-05-18
200 OK2018-05-15
200 OK2018-05-11
200 OK2018-05-08
200 OK2018-05-04
200 OK2018-05-01
200 OK2018-04-27
200 OK2018-04-24
200 OK2018-04-20
200 OK2018-04-17
200 OK2018-04-13
200 OK2018-04-10
200 OK2018-04-06
200 OK2018-04-03
200 OK2018-02-27
200 OK2018-02-23
200 OK2018-02-20
200 OK2018-02-16
200 OK2018-02-13
200 OK2018-02-09
200 OK2018-02-06
200 OK2018-02-02
200 OK2018-01-30
200 OK2018-01-26
200 OK2018-01-23
200 OK2018-01-19
200 OK2018-01-16
200 OK2018-01-12
200 OK2018-01-09
200 OK2018-01-05
200 OK2018-01-02
200 OK2017-12-29
200 OK2017-12-26
200 OK2017-12-22
200 OK2017-12-19
200 OK2017-12-15
200 OK2017-12-12
200 OK2017-12-08
200 OK2017-12-05
200 OK2017-12-01
-1 Failed2017-11-28
-1 Failed2017-11-24
200 OK2017-11-21
200 OK2017-11-17
200 OK2017-11-14
200 OK2017-11-10
200 OK2017-11-07
200 OK2017-11-03
200 OK2017-10-31
200 OK2017-10-27
200 OK2017-10-24
200 OK2017-10-20
200 OK2017-10-17
200 OK2017-10-13
200 OK2017-10-10
200 OK2017-10-06
200 OK2017-10-03
200 OK2017-09-29
200 OK2017-09-26
200 OK2017-09-22
200 OK2017-09-19
200 OK2017-09-15
200 OK2017-09-12
200 OK2017-09-08
200 OK2017-09-05
200 OK2017-09-01
200 OK2017-08-29
200 OK2017-08-25
200 OK2017-08-22
200 OK2017-08-18
200 OK2017-08-15
200 OK2017-08-11
200 OK2017-08-08
200 OK2017-08-04
200 OK2017-08-01
200 OK2017-07-28
200 OK2017-07-25
200 OK2017-07-21
200 OK2017-07-18
200 OK2017-07-14
200 OK2017-07-04
200 OK2017-06-30
200 OK2017-06-27
200 OK2017-06-23
200 OK2017-06-20
200 OK2017-06-16
200 OK2017-06-13
200 OK2017-06-09
200 OK2017-06-06
200 OK2017-06-02
200 OK2017-05-30
200 OK2017-05-26
200 OK2017-05-23
200 OK2017-05-19
200 OK2017-05-16
200 OK2017-05-12
200 OK2017-05-09
200 OK2017-05-05
200 OK2017-05-02
200 OK2017-04-28
200 OK2017-04-25
200 OK2017-04-21
200 OK2017-04-18
200 OK2017-04-14
200 OK2017-04-11
200 OK2017-04-07
200 OK2017-04-04
200 OK2017-03-31
200 OK2017-03-28
200 OK2017-03-24
200 OK2017-03-21
200 OK2017-03-17
503 Failed2017-03-14
200 OK2017-03-10
200 OK2017-03-07
200 OK2017-03-03
200 OK2017-02-28
200 OK2017-02-24
200 OK2017-02-21
200 OK2017-02-17
200 OK2017-02-14
200 OK2017-02-10
200 OK2017-02-07
200 OK2017-02-03
200 OK2017-01-31
200 OK2017-01-27
200 OK2017-01-24
200 OK2017-01-20
200 OK2017-01-17
200 OK2017-01-13
200 OK2017-01-10
200 OK2017-01-06
200 OK2017-01-03
200 OK2016-12-30
200 OK2016-12-27
200 OK2016-12-23
200 OK2016-12-20
200 OK2016-12-16
200 OK2016-12-13
200 OK2016-12-09
200 OK2016-12-06
200 OK2016-12-02
200 OK2016-11-29
200 OK2016-11-25
200 OK2016-11-22
200 OK2016-11-18
200 OK2016-11-15
200 OK2016-11-11
200 OK2016-11-08
200 OK2016-11-04
200 OK2016-11-01
200 OK2016-10-28
200 OK2016-10-25
200 OK2016-10-21
200 OK2016-10-18
200 OK2016-10-14
200 OK2016-10-11
200 OK2016-10-07
200 OK2016-10-04
200 OK2016-09-30
200 OK2016-09-27
200 OK2016-09-23
200 OK2016-09-20
200 OK2016-09-16
200 OK2016-09-13
200 OK2016-09-09
200 OK2016-09-06
200 OK2016-09-02
200 OK2016-08-30
200 OK2016-08-26
200 OK2016-08-23
200 OK2016-08-19
200 OK2016-08-16
200 OK2016-08-12
200 OK2016-08-09
200 OK2016-08-05
200 OK2016-08-02
200 OK2016-07-29
200 OK2016-07-26
200 OK2016-07-22
200 OK2016-07-19
200 OK2016-07-15
200 OK2016-07-12
200 OK2016-07-08
200 OK2016-07-05
200 OK2016-07-01
200 OK2016-06-28
200 OK2016-06-24
200 OK2016-06-21
200 OK2016-06-17
200 OK2016-06-14
200 OK2016-06-10
200 OK2016-06-07
200 OK2016-06-03
200 OK2016-05-31
200 OK2016-05-27
200 OK2016-05-24
200 OK2016-05-20
200 OK2016-05-17
200 OK2016-05-13
200 OK2016-05-10
200 OK2016-05-06
200 OK2016-05-03
200 OK2016-04-29
200 OK2016-04-26
200 OK2016-04-22
200 OK2016-04-19
200 OK2016-04-15
200 OK2016-04-12
200 OK2016-04-08
200 OK2016-04-05
200 OK2016-04-01
200 OK2016-03-29
200 OK2016-03-28
200 OK2016-03-25
200 OK2016-03-23
200 OK2016-03-21
200 OK2016-03-18
200 OK2016-03-16
200 OK2016-03-14
200 OK2016-03-11
200 OK2016-03-09
200 OK2016-03-07
200 OK2016-03-04
200 OK2016-03-02
200 OK2016-02-29
200 OK2016-02-26
200 OK2016-02-24
200 OK2016-02-22
200 OK2016-02-19
200 OK2016-02-17
200 OK2016-02-15
200 OK2016-02-14
200 OK2016-02-12
200 OK2016-02-10
200 OK2016-02-08
200 OK2016-02-07
200 OK2016-02-05
200 OK2016-02-03
200 OK2016-02-01
200 OK2016-01-31
200 OK2016-01-29
200 OK2016-01-27
200 OK2016-01-25
200 OK2016-01-24
200 OK2016-01-22
200 OK2016-01-20
200 OK2016-01-18
200 OK2016-01-17
200 OK2016-01-15
200 OK2016-01-13
200 OK2016-01-11
200 OK2016-01-10
200 OK2016-01-08
200 OK2016-01-06
200 OK2016-01-04

Tags

DNA Protein
Eukaryota Prokaryote
ligand-binding site

Record metadata

  • Created on: 2015-06-20
  • Curated by:
    • Lina Ma [2016-08-17]
    • Shixiang Sun [2016-03-25]
    • Shixiang Sun [2015-11-21]
    • Shixiang Sun [2015-06-28]
    • Shixiang Sun [2015-06-26]
Stats