scholarly journals Efficient protein structure search using indexing methods

2013 ◽  
Vol 13 (S1) ◽  
Author(s):  
Sungchul Kim ◽  
Lee Sael ◽  
Hwanjo Yu
2009 ◽  
Vol 37 (Web Server) ◽  
pp. W480-W484 ◽  
Author(s):  
T. Margraf ◽  
G. Schenk ◽  
A. E. Torda

2018 ◽  
Vol 34 (17) ◽  
pp. i773-i780 ◽  
Author(s):  
Yang Liu ◽  
Qing Ye ◽  
Liwei Wang ◽  
Jian Peng

2020 ◽  
Author(s):  
Ronald Ayoub ◽  
Yugyung Lee

AbstractProtein structure prediction is a long-standing unsolved problem in molecular biology that has seen renewed interest with the recent success of deep learning with AlphaFold at CASP13. While developing and evaluating protein structure prediction methods, researchers may want to identify the most similar known structures to their predicted structures. These predicted structures often have low sequence and structure similarity to known structures. We show how RUPEE, a purely geometric protein structure search, is able to identify the structures most similar to structure predictions, regardless of how they vary from known structures, something existing protein structure searches struggle with. RUPEE accomplishes this through the use of a novel linear encoding of protein structures as a sequence of residue descriptors. Using a fast Needleman-Wunsch algorithm, RUPEE is able to perform alignments on the sequences of residue descriptors for every available structure. This is followed by a series of increasingly accurate structure alignments from TM-align alignments initialized with the Needleman-Wunsch residue descriptor alignments to standard TM-align alignments of the final results. By using alignment normalization effectively at each stage, RUPEE also can execute containment searches in addition to full-length searches to identify structural motifs within proteins. We compare the results of RUPEE to mTM-align, SSM, CATHEDRAL and VAST using a benchmark derived from the protein structure predictions submitted to CASP13. RUPEE identifies better alignments on average with respect to RMSD and TM-score as well as Q-score and SSAP-score, scores specific to SSM and CATHEDRAL, respectively. Finally, we show a sample of the top-scoring alignments that RUPEE identified that none of the other protein structure searches we compared to were able to identify.The RUPEE protein structure search is available at https://ayoubresearch.com. Code and data are available at https://github.com/rayoub/rupee.


2018 ◽  
Author(s):  
Ronald Ayoub ◽  
Yugyung Lee

AbstractGiven the close relationship between protein structure and function, protein structure searches have long played an established role in bioinformatics. Despite their maturity, existing protein structure searches either use simplifying assumptions or compromise between fast response times and quality of results. These limitations can prevent the easy and efficient exploration of relationships between protein structures, which is the norm in other areas of inquiry. We have developed RUPEE, a fast, scalable, and purely geometric structure search combining techniques from information retrieval and big data with a novel approach to encoding sequences of torsion angles.Comparing our results to the output of mTM, SSM, and the CATHEDRAL structural scan, it is clear that RUPEE has set a new bar for purely geometric big data approaches to protein structure searches. RUPEE in top-aligned mode produces equal or better results than the best available protein structure searches, and RUPEE in fast mode demonstrates the fastest response times coupled with high quality results.The RUPEE protein structure search is available at http://www.ayoubresearch.com. Code and data are available at https://github.com/rayoub/rupee.


IUCrJ ◽  
2018 ◽  
Vol 5 (5) ◽  
pp. 548-558 ◽  
Author(s):  
Ti-Yen Lan ◽  
Jennifer L. Wierman ◽  
Mark W. Tate ◽  
Hugh T. Philipp ◽  
Jose M. Martin-Garcia ◽  
...  

In recent years, the success of serial femtosecond crystallography and the paucity of beamtime at X-ray free-electron lasers have motivated the development of serial microcrystallography experiments at storage-ring synchrotron sources. However, especially at storage-ring sources, if a crystal is too small it will have suffered significant radiation damage before diffracting a sufficient number of X-rays into Bragg peaks for peak-indexing software to determine the crystal orientation. As a consequence, the data frames of small crystals often cannot be indexed and are discarded. Introduced here is a method based on the expand–maximize–compress (EMC) algorithm to solve protein structures, specifically from data frames for which indexing methods fail because too few X-rays are diffracted into Bragg peaks. The method is demonstrated on a real serial microcrystallography data set whose signals are too weak to be indexed by conventional methods. In spite of the daunting background scatter from the sample-delivery medium, it was still possible to solve the protein structure at 2.1 Å resolution. The ability of the EMC algorithm to analyze weak data frames will help to reduce sample consumption. It will also allow serial microcrystallography to be performed with crystals that are otherwise too small to be feasibly analyzed at storage-ring sources.


2021 ◽  
Author(s):  
Tunde Aderinwale ◽  
Vijay Bharadwaj ◽  
Charles Christoffer ◽  
Genki Terashi ◽  
Zicong Zhang ◽  
...  

AlphaFold2 showed a substantial improvement in the accuracy of protein structure prediction. Following the release of the software, whole-proteome protein structure predictions by AlphaFold2 for 21 organisms were made publicly available. Here, we developed the infrastructure, 3D-AF-Surfer, to enable real-time structure-based search for the AlphaFold2 models by combining molecular surface representation with 3D Zernike descriptors and deep neural networks.


2010 ◽  
Vol 38 (Web Server) ◽  
pp. W53-W58 ◽  
Author(s):  
C.-R. Shyu ◽  
B. Pang ◽  
P.-H. Chi ◽  
N. Zhao ◽  
D. Korkin ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document