TOP: a new method for protein structure comparisons and similarity searches

2000 ◽  
Vol 33 (1) ◽  
pp. 176-183 ◽  
Author(s):  
Guoguang Lu
Keyword(s):  
User Interface ◽  
Protein Structure ◽  
Protein Structures ◽  
Three Dimensional ◽  
Data Bank ◽  
Structure Alignment ◽  
Dimensional Structure ◽  
Protein Structure Alignment ◽  
Protein Structure Analysis ◽  
Structure Comparison

In order to facilitate the three-dimensional structure comparison of proteins, software for making comparisons and searching for similarities to protein structures in databases has been developed. The program identifies the residues that share similar positions of both main-chain and side-chain atoms between two proteins. The unique functions of the software also include database processingviaInternet- and Web-based servers for different types of users. The developed method and its friendly user interface copes with many of the problems that frequently occur in protein structure comparisons, such as detecting structurally equivalent residues, misalignment caused by coincident match of Cαatoms, circular sequence permutations, tedious repetition of access, maintenance of the most recent database, and inconvenience of user interface. The program is also designed to cooperate with other tools in structural bioinformatics, such as the 3DB Browser software [Prilusky (1998).Protein Data Bank Q. Newslett.84, 3–4] and the SCOP database [Murzin, Brenner, Hubbard & Chothia (1995).J. Mol. Biol.247, 536–540], for convenient molecular modelling and protein structure analysis. A similarity ranking score of `structure diversity' is proposed in order to estimate the evolutionary distance between proteins based on the comparisons of their three-dimensional structures. The function of the program has been utilized as a part of an automated program for multiple protein structure alignment. In this paper, the algorithm of the program and results of systematic tests are presented and discussed.

MRPC (Missing Regions in Polypeptide Chains): a knowledgebase

2019 ◽  
Vol 52 (6) ◽  
pp. 1422-1426
Author(s):  
Rajendran Santhosh ◽  
Namrata Bankoti ◽  
Adgonda Malgonnavar Padmashri ◽  
Daliah Michael ◽  
Jeyaraman Jeyakanthan ◽  
...  
Keyword(s):  
Protein Structures ◽  
Three Dimensional ◽  
Protein Molecule ◽  
Data Bank ◽  
Protein Crystal ◽  
Dimensional Structure ◽  
Protein Structure Analysis ◽  
Three Dimensional Structure ◽  
X Ray Crystallography ◽  
Polypeptide Chains

Missing regions in protein crystal structures are those regions that cannot be resolved, mainly owing to poor electron density (if the three-dimensional structure was solved using X-ray crystallography). These missing regions are known to have high B factors and could represent loops with a possibility of being part of an active site of the protein molecule. Thus, they are likely to provide valuable information and play a crucial role in the design of inhibitors and drugs and in protein structure analysis. In view of this, an online database, Missing Regions in Polypeptide Chains (MRPC), has been developed which provides information about the missing regions in protein structures available in the Protein Data Bank. In addition, the new database has an option for users to obtain the above data for non-homologous protein structures (25 and 90%). A user-friendly graphical interface with various options has been incorporated, with a provision to view the three-dimensional structure of the protein along with the missing regions using JSmol. The MRPC database is updated regularly (currently once every three months) and can be accessed freely at the URL http://cluster.physics.iisc.ac.in/mrpc.

MatAlign: PRECISE PROTEIN STRUCTURE COMPARISON BY MATRIX ALIGNMENT

2006 ◽  
Vol 04 (06) ◽  
pp. 1197-1216 ◽  
Author(s):  
ZEYAR AUNG ◽  
KIAN-LEE TAN
Keyword(s):  
Protein Structure ◽  
Protein Structures ◽  
Scoring Function ◽  
Structure Alignment ◽  
Supplementary Information ◽  
Protein Structure Alignment ◽  
Initial Alignment ◽  
Structure Comparison ◽  
Structural Database ◽  
Step Algorithm

We propose a detailed protein structure alignment method named "MatAlign". It is a two-step algorithm. Firstly, we represent 3D protein structures as 2D distance matrices, and align these matrices by means of dynamic programming in order to find the initially aligned residue pairs. Secondly, we refine the initial alignment iteratively into the optimal one according to an objective scoring function. We compare our method against DALI and CE, which are among the most accurate and the most widely used of the existing structural comparison tools. On the benchmark set of 68 protein structure pairs by Fischer et al., MatAlign provides better alignment results, according to four different criteria, than both DALI and CE in a majority of cases. MatAlign also performs as well in structural database search as DALI does, and much better than CE does. MatAlign is about two to three times faster than DALI, and has about the same speed as CE. The software and the supplementary information for this paper are available at . .

scholarly journals A COMPARATIVE STUDY OF PROTEIN TERTIARY STRUCTURE PREDICTION METHODS

2014 ◽  
pp. 15-18
Author(s):  
CHANDRAYANI N. ROKDE ◽  
DR.MANALI KSHIRSAGAR
Keyword(s):  
Protein Structure ◽  
Structure Prediction ◽  
Tertiary Structure ◽  
Sequence Data ◽  
Protein Structures ◽  
Three Dimensional ◽  
Data Bank ◽  
Dimensional Structure ◽  
X Ray Crystallography ◽  
Protein Tertiary Structure Prediction

Protein structure prediction (PSP) from amino acid sequence is one of the high focus problems in bioinformatics today. This is due to the fact that the biological function of the protein is determined by its three dimensional structure. The understanding of protein structures is vital to determine the function of a protein and its interaction with DNA, RNA and enzyme. Thus, protein structure is a fundamental area of computational biology. Its importance is intensed by large amounts of sequence data coming from PDB (Protein Data Bank) and the fact that experimentally methods such as X-ray crystallography or Nuclear Magnetic Resonance (NMR)which are used to determining protein structures remains very expensive and time consuming. In this paper, different types of protein structures and methods for its prediction are described.

scholarly journals pmTM-align: scalable pairwise and multiple structure alignment with Apache Spark and OpenMP

2020 ◽  
Vol 21 (1) ◽  
Author(s):  
Weiya Chen ◽  
Chun Yao ◽  
Yingzhong Guo ◽  
Yan Wang ◽  
Zhidong Xue
Keyword(s):  
Protein Structure ◽  
Phylogenetic Tree ◽  
Large Scale ◽  
Evolutionary Relationship ◽  
Computation Time ◽  
Data Bank ◽  
Structure Alignment ◽  
Protein Structure Alignment ◽  
Structure Comparison ◽  
Multiple Structure

Abstract Background Structure comparison can provide useful information to identify functional and evolutionary relationship between proteins. With the dramatic increase of protein structure data in the Protein Data Bank, computation time quickly becomes the bottleneck for large scale structure comparisons. To more efficiently deal with informative multiple structure alignment tasks, we propose pmTM-align, a parallel protein structure alignment approach based on mTM-align/TM-align. pmTM-align contains two stages to handle pairwise structure alignments with Spark and the phylogenetic tree-based multiple structure alignment task on a single computer with OpenMP. Results Experiments with the SABmark dataset showed that parallelization along with data structure optimization provided considerable speedup for mTM-align. The Spark-based structure alignments achieved near ideal scalability with large datasets, and the OpenMP-based construction of the phylogenetic tree accelerated the incremental alignment of multiple structures and metrics computation by a factor of about 2–5. Conclusions pmTM-align enables scalable pairwise and multiple structure alignment computing and offers more timely responses for medium to large-sized input data than existing alignment tools such as mTM-align.

PROTEIN STRUCTURE ALIGNMENT AND FAST SIMILARITY SEARCH USING LOCAL SHAPE SIGNATURES

2004 ◽  
Vol 02 (01) ◽  
pp. 215-239 ◽  
Author(s):  
TOLGA CAN ◽  
YUAN-FANG WANG
Keyword(s):  
Protein Structure ◽  
Protein Structures ◽  
Structure Alignment ◽  
Protein Structure Alignment ◽  
Specific Information ◽  
Alignment Algorithm ◽  
Screening Process ◽  
Domain Specific ◽  
Local Sequence ◽  
Shape Signatures

We present a new method for conducting protein structure similarity searches, which improves on the efficiency of some existing techniques. Our method is grounded in the theory of differential geometry on 3D space curve matching. We generate shape signatures for proteins that are invariant, localized, robust, compact, and biologically meaningful. The invariancy of the shape signatures allows us to improve similarity searching efficiency by adopting a hierarchical coarse-to-fine strategy. We index the shape signatures using an efficient hashing-based technique. With the help of this technique we screen out unlikely candidates and perform detailed pairwise alignments only for a small number of candidates that survive the screening process. Contrary to other hashing based techniques, our technique employs domain specific information (not just geometric information) in constructing the hash key, and hence, is more tuned to the domain of biology. Furthermore, the invariancy, localization, and compactness of the shape signatures allow us to utilize a well-known local sequence alignment algorithm for aligning two protein structures. One measure of the efficacy of the proposed technique is that we were able to perform structure alignment queries 36 times faster (on the average) than a well-known method while keeping the quality of the query results at an approximately similar level.

scholarly journals Implementation of a Parallel Protein Structure Alignment Service on Cloud

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Che-Lun Hung ◽  
Yaw-Ling Lin
Keyword(s):  
Protein Structure ◽  
Programming Model ◽  
Protein Structures ◽  
Structure Alignment ◽  
Evolutionary Relationships ◽  
Protein Structure Alignment ◽  
Alignment Algorithm ◽  
Cloud Platform ◽  
Computational Performance ◽  
Refinement Algorithm

Protein structure alignment has become an important strategy by which to identify evolutionary relationships between protein sequences. Several alignment tools are currently available for online comparison of protein structures. In this paper, we propose a parallel protein structure alignment service based on the Hadoop distribution framework. This service includes a protein structure alignment algorithm, a refinement algorithm, and a MapReduce programming model. The refinement algorithm refines the result of alignment. To process vast numbers of protein structures in parallel, the alignment and refinement algorithms are implemented using MapReduce. We analyzed and compared the structure alignments produced by different methods using a dataset randomly selected from the PDB database. The experimental results verify that the proposed algorithm refines the resulting alignments more accurately than existing algorithms. Meanwhile, the computational performance of the proposed service is proportional to the number of processors used in our cloud platform.

Prediction of Structural and Functional Aspects of Protein

2014 ◽  
pp. 317-333
Author(s):  
Arun G. Ingale
Keyword(s):  
Protein Structure ◽  
Protein Structure Prediction ◽  
Structure Prediction ◽  
Tertiary Structure ◽  
Protein Structures ◽  
Three Dimensional ◽  
Dimensional Structure ◽  
Sequence Information ◽  
Predict Protein Structure ◽  
Basic Ideas

To predict the structure of protein from a primary amino acid sequence is computationally difficult. An investigation of the methods and algorithms used to predict protein structure and a thorough knowledge of the function and structure of proteins are critical for the advancement of biology and the life sciences as well as the development of better drugs, higher-yield crops, and even synthetic bio-fuels. To that end, this chapter sheds light on the methods used for protein structure prediction. This chapter covers the applications of modeled protein structures and unravels the relationship between pure sequence information and three-dimensional structure, which continues to be one of the greatest challenges in molecular biology. With this resource, it presents an all-encompassing examination of the problems, methods, tools, servers, databases, and applications of protein structure prediction, giving unique insight into the future applications of the modeled protein structures. In this chapter, current protein structure prediction methods are reviewed for a milieu on structure prediction, the prediction of structural fundamentals, tertiary structure prediction, and functional imminent. The basic ideas and advances of these directions are discussed in detail.

Algorithmic Aspects of Protein Threading

2011 ◽  
pp. 605-619
Author(s):  
Tatsuya Akutsu
Keyword(s):  
Protein Structure ◽  
Protein Structure Prediction ◽  
Structure Prediction ◽  
Three Dimensional ◽  
Structure Alignment ◽  
Protein Structure Alignment ◽  
Amino Acid Residues ◽  
Optimal Solutions ◽  
Score Functions ◽  
Protein Threading

This chapter provides an overview of computational problems and techniques for protein threading. Protein threading is one of the most powerful approaches to protein structure prediction, where protein structure prediction is to infer three-dimensional (3-D) protein structure for a given protein sequence. Protein threading can be modeled as an optimization problem. Optimal solutions can be obtained in polynomial time using simple dynamic programming algorithms if profile type score functions are employed. However, this problem is computationally hard (NP-hard) if score functions include pairwise interaction preferences between amino acid residues. Therefore, various algorithms have been developed for finding optimal or near-optimal solutions. This chapter explains the ideas employed in these algorithms. This chapter also gives brief explanations of related problems: protein threading with constraints, comparison of RNA secondary structures and protein structure alignment.

PSAP: protein structure analysis package

2007 ◽  
Vol 40 (4) ◽  
pp. 773-777 ◽  
Author(s):  
B. Balamurugan ◽  
M. N. A. Md. Roshan ◽  
B. Shaahul Hameed ◽  
K. Sumathi ◽  
R. Senthilkumar ◽  
...  
Keyword(s):  
Protein Structure ◽  
Structure Analysis ◽  
Protein Structures ◽  
Three Dimensional ◽  
Protein Structure Analysis ◽  
Molecular Graphics ◽  
Client Machine ◽  
Analysis Package ◽  
Functional Features ◽  
Atomic Coordinates

A computing engine, theProtein Structure Analysis Package(PSAP), has been developed to calculate and display various hidden structural and functional features of three-dimensional protein structures. The proposed computing engine has several utilities to enable structural biologists to analyze three-dimensional protein molecules and provides an easy-to-use Web interface to compute and visualize the necessary features dynamically on the client machine. Users need to provide the Protein Data Bank (PDB) identification code or upload three-dimensional atomic coordinates from the client machine. For visualization, the free molecular graphics programsRasMolandJmolare deployed in the computing engine. Furthermore, the computing engine is interfaced with an up-to-date local copy of the PDB. The atomic coordinates are updated every week and hence users can access all the structures available in the PDB. The computing engine is free and is accessible online at http://iris.physics.iisc.ernet.in/psap/.

Sign in / Sign up

Export Citation Format

Share Document