Software
FRAGMENT GDB: Fragment Graph Database |
AvailabilityCiting FGDB If you publish results obtained by using FGDB please cite:
|
FGDB is a graph database of ligand fragments extracted and generated from the protein entries available in the Protein Data Bank. FGDB is meant to support and elicit campaigns of fragment-based drug design, by enabling users to query it in order to construct ad-hoc, target-specific libraries. In this regard, the database features more than 17,000 fragments, typically small, highly-soluble and chemically-stable molecules expressed via their canonical SMILES representation. For these fragments, the database provides information related to their contact frequencies with the amino acids, the ligands they are contained in, and the proteins the latter bind to. The graph database can be queried via standard web forms and textual searches by a number of identifiers (SMILES, ligand and protein PDB ids, etc.), as well as via graphical queries that can be performed against the graph itself, providing users with an intuitive and effective view upon the underlying biological entities. Further search mechanisms via advanced conjunctive/disjunctive/negated textual queries are also possible, in order to allow scientists to look for specific relationships and export their results for further studies. |
LIBRAWA: Ligand Binding site Recognition Web Application |
AvailabilityClick here to access LIBRA Web Application Citing LIBRA WA If you publish results obtained by using LIBRAWA please cite:
|
LIBRA Web Application is an online portal where users can exploit LIBRA+'s capabilities in recognizing the presence and identity of active sites and/or ligand binding sites given a protein's structural model. With a free registration, users are given a personal space where they can launch and schedule multiple recognitions, check out the resulting three-dimensional alignments and browse ligand clusters. Results produced in LIBRAWA are backward-compatible with LIBRA+ and can thus be exported in LIBRA+'s format to be accessed offline from the desktop application. |
LIBRA+: Ligand Binding site Recognition Application Plus |
DownloadLIBRA+.zip (v. 2017-09-15, requires Java 1.7+) Citing LIBRA+ If you publish results obtained by using LIBRA+ please cite:
|
LIBRA+ is an upgraded version of LIBRA, a tool that, given a protein's structural model, predicts the presence and identity of active sites and/or ligand binding sites. The algorithm implemented by LIBRA+ is based on a graph theory approach to find the largest subset of similar residues between an input protein and a collection of known functional sites. For this purpose, the algorithm makes use of two predefined databases for active sites and ligand binding sites, respectively derived from the Catalytic Site Atlas and the Protein Data Bank. |
DockingApp: Application for Docking and Virtual Screening |
DownloadLinux x64: DockingApp_Linux_x64.tar.gz Citing DockingApp If you publish results obtained by using DockingApp please cite:
|
DockingApp is a user-friendly graphical application for carrying out molecular docking and virtual screening tasks, meant to enable non-experienced users to easily perform such activities and browse the docking results via a three-dimensional visualization. |
DockingApp RF: Docking and Replicated Docking with a state-of-the-art scoring function |
DownloadLinux x64: DockingApp_RF_Linux_x64.tar.gz Citing DockingApp RF If you publish results obtained by using DockingApp RF please cite:
|
DockingApp RF is a user-friendly graphical application for carrying out molecular docking and replicated docking, meant to enable non-experienced users to easily perform such activities and browse the docking results via a three-dimensional visualization. It implements a state-of-the-art scoring function based on a Random Forest algorithm, whose effectiveness has been proven on specific use cases of molecular docking, making DockingApp RF complementary to the classic DockingApp. |
PRAISED: Protein-Related Abbreviation Identification, StoragE and Disambiguation |
AvailabilityPRAISED will be online soon. Citing PRAISED If you publish results obtained by using PRAISED please cite:
|
PRAISED is a lightweight framework for identifying and resolving protein-related abbreviations found in the full text of scientific papers. It is based on a three-phase process where: candidate abbreviations are firstly detected within an unstructured text, based on lexical clues and exclusion rules; abbreviations are then matched with their potential explanation, using syntactical and semantic criteria combined with fitting optimization techniques; and finally, resulting abbreviation-explanation pairs are sorted out according to the domain of interest, by performing an entity recognition phase against repositories of known biological entities. AcknowledgmentsThe authors would like to thank Ing. Augusto Accosta for his vital contribution in the development of the PRAISED framework. |
LIBRA: Ligand Binding site Recognition Application |
DownloadLIBRAv1.zip (v. 2015-07-13, requires Java 1.7+) Citing LIBRA If you publish results obtained by using LIBRA please cite:
|
LIBRA is a novel software tool that, given a protein's structural model, predicts the presence and identity of active sites and/or ligand binding sites. The algorithm implemented by LIBRA is based on a graph theory approach to find the largest subset of similar residues between an input protein and a collection of known functional sites. For this purpose, the algorithm makes use of two predefined databases for active sites and ligand binding sites, respectively derived from the Catalytic Site Atlas and the Protein Data Bank.
Instructions for installing LIBRA, running the program and analyzing the output can be found in the README file provided within the package.
|
ASSIST: Active Site Similarity Search Tool |
DownloadASSISTv1.zip (v. 2013-11-21, requires Java 1.6+) Citing ASSIST If you publish results obtained by using ASSIST please cite:
|
ASSIST is an application for the detection of catalytic sites in unknown function proteins. ASSIST is based on a local geometric/chemical comparison algorithm implemented to find the largest subset of similar residues (at the sidechain and/or backbone level) between an input protein and query sites/motifs. The user provides a protein structure as input and ASSIST performs a search for known functional sites based on a geometric hashing approach. The known catalytic sites are extracted from Janet Thornton Catalytic Site Atlas. Nonetheless, other functional motifs can be plugged in for the ASSIST execution in the form of coordinate files in PDB format. Instructions for installing ASSIST, running the program and analyzing the output can be found in the README file provided within the package. |