Ilya A. Vakser

Ilya A. Vakser

Auto-generated profile, based on publicly available information

Ilya A. Vakser

Computational Biology Program The University of Kansas Lawrence Kansas USA

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2006 in Nucleic Acids Research
Verified
Journal Article
Open access
ATA. Tovchigrechko
A. Tovchigrechko
IVI. A. Vakser
I. A. Vakser
Protein docking software GRAMM-X and its web interface (http://vakser.bioinformatics.ku.edu/resources/gramm/grammx) extend the original GRAMM Fast Fourier Transformation methodology by employing smoothed potentials, refinement stage, and knowledge-based scoring. The web server frees users from complex installation of database-dependent parallel software and maintaining large hardware resources needed for protein docking simulations. Docking problems submitted to GRAMM-X server are processed by a 320 processor Linux cluster. The server was extensively tested by benchmarking, several months of public use, and participation in the CAPRI server track.

1 October 2014 in Biophysical Journal
Verified
Journal Article
Closed access
IVIlya A. Vakser
Ilya A. Vakser

29 May 2012 in Proceedings of the National Academy of Sciences
Verified
Journal Article
Open access
PDF file
PKPetras J. Kundrotas
Petras J. Kundrotas
ZZZhengwei Zhu
Zhengwei Zhu
JJJoël Janin
Joël Janin
IVIlya A. Vakser
Ilya A. Vakser
Traditional approaches to protein–protein docking sample the binding modes with no regard to similar experimentally determined structures (templates) of protein–protein complexes. Emerging template-based docking approaches utilize such similar complexes to determine the docking predictions. The docking problem assumes the knowledge of the participating proteins’ structures. Thus, it provides the possibility of aligning the structures of the proteins and the template complexes. The progress in the development of template-based docking and the vast experience in template-based modeling of individual proteins show that, generally, such approaches are more reliable than the free modeling. The key aspect of this modeling paradigm is the availability of the templates. The current common perception is that due to the difficulties in experimental structure determination of protein–protein complexes, the pool of docking templates is insignificant, and thus a broad application of template-based docking is possible only at some future time. The results of our large scale, systematic study show that, surprisingly, in spite of the limited number of protein–protein complexes in the Protein Data Bank, docking templates can be found for complexes representing almost all the known protein–protein interactions, provided the components themselves have a known structure or can be homology-built. About one-third of the templates are of good quality when they are compared to experimental structures in test sets extracted from the Protein Data Bank and would be useful starting points in modeling the complexes. This finding dramatically expands our ability to model protein interactions, and has far-reaching implications for the protein docking field in general.

8 September 2023
Verified
Book Chapter
Closed access
ASAmar Singh
Amar Singh
MCMatthew M. Copeland
Matthew M. Copeland
PKPetras Kundrotas
Petras Kundrotas
IVIlya A. Vakser
Ilya A. Vakser

24 June 2005 in Proteins: Structure, Function, and Bioinformatics
Verified
Journal Article
Closed access
PDF file
ATAndrei Tovchigrechko
Andrei Tovchigrechko
IVIlya A. Vakser
Ilya A. Vakser

13 September 2021 in Proteins: Structure, Function, and Bioinformatics
Verified
Journal Article
Closed access
PDF file
MLMarc Lensink
Marc Lensink
GBGuillaume Brysbaert
Guillaume Brysbaert
TMThéo Mauri
Théo Mauri
NNNurul Nadzirin
Nurul Nadzirin
SVSameer Velankar
Sameer Velankar
SWshoshana wodak
shoshana wodak