PROTEIN STRUCTURE: INSIGHTS FROM GRAPH THEORY

2002 ◽  
Vol 01 (01) ◽  
pp. 187-211 ◽  
Author(s):  
SARASWATHI VISHVESHWARA ◽  
K. V. BRINDA ◽  
N. KANNAN
Keyword(s):  
Graph Theory ◽  
Protein Structure ◽  
Computer Networks ◽  
Electrical Engineering ◽  
Protein Structures ◽  
Large Body ◽  
Biological Information ◽  
Stability Function ◽  
Graph Theoretic ◽  
Efficient Extraction

The sequence and structure of a large body of proteins are becoming increasingly available. It is desirable to explore mathematical tools for efficient extraction of information from such sources. The principles of graph theory, which was earlier applied in fields such as electrical engineering and computer networks are now being adopted to investigate protein structure, folding, stability, function and dynamics. This review deals with a brief account of relevant graphs and graph theoretic concepts. The concepts of protein graph construction are discussed. The manner in which graphs are analyzed and parameters relevant to protein structure are extracted, are explained. The structural and biological information derived from protein structures using these methods is presented.

scholarly journals ProSNEx: a web-based application for exploration and analysis of protein structures using network formalism

2019 ◽  
Vol 47 (W1) ◽  
pp. W471-W476 ◽  
Author(s):  
Rasim Murat Aydınkal ◽  
Onur Serçinoğlu ◽  
Pemra Ozbek
Keyword(s):  
Protein Structure ◽  
Normal Mode Analysis ◽  
Shortest Paths ◽  
Protein Structures ◽  
Interaction Strength ◽  
Biological Information ◽  
Coarse Grained ◽  
Mode Analysis ◽  
Residue Interaction ◽  
Natural Variant

AbstractProSNEx (Protein Structure Network Explorer) is a web service for construction and analysis of Protein Structure Networks (PSNs) alongside amino acid flexibility, sequence conservation and annotation features. ProSNEx constructs a PSN by adding nodes to represent residues and edges between these nodes using user-specified interaction distance cutoffs for either carbon-alpha, carbon-beta or atom-pair contact networks. Different types of weighted networks can also be constructed by using either (i) the residue-residue interaction energies in the format returned by gRINN, resulting in a Protein Energy Network (PEN); (ii) the dynamical cross correlations from a coarse-grained Normal Mode Analysis (NMA) of the protein structure; (iii) interaction strength. Upon construction of the network, common network metrics (such as node centralities) as well as shortest paths between nodes and k-cliques are calculated. Moreover, additional features of each residue in the form of conservation scores and mutation/natural variant information are included in the analysis. By this way, tool offers an enhanced and direct comparison of network-based residue metrics with other types of biological information. ProSNEx is free and open to all users without login requirement at http://prosnex-tool.com.

scholarly journals Structural Bioinformatics: Computational Software and Databases for the Evaluation of Protein Structure

2018 ◽  
Vol 9 (2) ◽  
pp. 94-101
Author(s):  
Ayisha Amanullah ◽  
Suad Naheed
Keyword(s):  
Protein Structure ◽  
Protein Structures ◽  
Similarity Index ◽  
Biological Data ◽  
Biological Information ◽  
Biological Databases ◽  
Protein Structure Analysis ◽  
Clinical Consequences ◽  
Structural Databases ◽  
Types Of Information

Databases are the computerized platform where information is stored and can be retrieved easily by public users. Biological databases are the repositories of biological data. These biological data libraries contain facts and figures related to various disciplines of research including genomics, proteomics, microarray technology, metabolomics and phylogenetics. By using biological databases, a broad collection of essential biological information can be exploited ranging from function, structure and localization of gene, clinical consequences of mutation to similarity index among biological sequences and structures. Nowadays, different kinds of biological databases are available on the web. The present write up focuses on biological databases and bioinformatics tools for protein structure analysis. This review also aims to elaborate the searching schemes, available in different structural databases. The wide variety of different levels and types of information content related to 3D protein structures are available on web-based databases. Regarding the biological functions and 3D structures of various proteins, these databases provide a huge range of useful links, schematic diagrams as well as strategies for detailed analysis of proteins and other macromolecules structures. 3D structural illustration of proteins stored in structural databases is determined and visualized by X-ray crystallography, electron microscopy and NMR spectroscopy. On regular basis, a large number of protein structures are submitted by structural biologists, updated and curated by subject experts. Most familiar biological databases that store 3D protein and other macromolecules structures include, PDB, 3D Genomics, CATH, & SCOP. These databases contain valuable information of overall protein structures, domains and motif structures, protein-protein complex systems and complex of protein with other biomolecules.

Sequence Specific Dihedral Angle Distribution: Application in Protein Structure Prediction and Evaluation

1970 ◽  
Vol 19 (2) ◽  
pp. 217-226
Author(s):  
S. M. Minhaz Ud-Dean ◽  
Mahdi Muhammad Moosa
Keyword(s):  
Protein Structure ◽  
Dihedral Angle ◽  
Protein Structure Prediction ◽  
Structure Prediction ◽  
Protein Structures ◽  
Angle Distribution ◽  
Ramachandran Plot ◽  
Specific Data ◽  
Specific Distribution ◽  
Structure Evaluation

Protein structure prediction and evaluation is one of the major fields of computational biology. Estimation of dihedral angle can provide information about the acceptability of both theoretically predicted and experimentally determined structures. Here we report on the sequence specific dihedral angle distribution of high resolution protein structures available in PDB and have developed Sasichandran, a tool for sequence specific dihedral angle prediction and structure evaluation. This tool will allow evaluation of a protein structure in pdb format from the sequence specific distribution of Ramachandran angles. Additionally, it will allow retrieval of the most probable Ramachandran angles for a given sequence along with the sequence specific data. Key words: Torsion angle, φ-ψ distribution, sequence specific ramachandran plot, Ramasekharan, protein structure appraisal D.O.I. 10.3329/ptcb.v19i2.5439 Plant Tissue Cult. & Biotech. 19(2): 217-226, 2009 (December)

Analysis of Oncogene Protein Structure Using Small World Network Concept

2020 ◽  
Vol 15 (7) ◽  
pp. 732-740
Author(s):  
Neetu Kumari ◽  
Anshul Verma
Keyword(s):  
Amino Acids ◽  
Protein Structure ◽  
Degree Distribution ◽  
Protein Structures ◽  
Small World ◽  
Extreme Condition ◽  
Centrality Measures ◽  
Small World Network ◽  
Network Concept ◽  
Oncogene Protein

Background: The basic building block of a body is protein which is a complex system whose structure plays a key role in activation, catalysis, messaging and disease states. Therefore, careful investigation of protein structure is necessary for the diagnosis of diseases and for the drug designing. Protein structures are described at their different levels of complexity: primary (chain), secondary (helical), tertiary (3D), and quaternary structure. Analyzing complex 3D structure of protein is a difficult task but it can be analyzed as a network of interconnection between its component, where amino acids are considered as nodes and interconnection between them are edges. Objective: Many literature works have proven that the small world network concept provides many new opportunities to investigate network of biological systems. The objective of this paper is analyzing the protein structure using small world concept. Methods: Protein is analyzed using small world network concept, specifically where extreme condition is having a degree distribution which follows power law. For the correct verification of the proposed approach, dataset of the Oncogene protein structure is analyzed using Python programming. Results: Protein structure is plotted as network of amino acids (Residue Interaction Graph (RIG)) using distance matrix of nodes with given threshold, then various centrality measures (i.e., degree distribution, Degree-Betweenness correlation, and Betweenness-Closeness correlation) are calculated for 1323 nodes and graphs are plotted. Conclusion: Ultimately, it is concluded that there exist hubs with higher centrality degree but less in number, and they are expected to be robust toward harmful effects of mutations with new functions.

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.

Modern Applications of Graph Theory

2021 ◽  
Author(s):  
Vadim Zverovich
Keyword(s):  
Graph Theory ◽  
Molecular Epidemiology ◽  
Emergency Response ◽  
Real Life ◽  
Dominating Sets ◽  
Postgraduate Students ◽  
Graph Theoretic ◽  
Electric Vehicle Charging ◽  
Advanced Students ◽  
Doctoral Dissertations

This book discusses many modern, cutting-edge applications of graph theory, such as traffic networks and Braess’ paradox, navigable networks and optimal routing for emergency response, backbone/dominating sets in wireless sensor networks, placement of electric vehicle charging stations, pedestrian safety and graph-theoretic methods in molecular epidemiology. Because of the rapid growth of research in this field, the focus of the book is on the up-to-date development of the aforementioned applications. The book will be ideal for researchers, engineers, transport planners and emergency response specialists who are interested in the recent development of graph theory applications. Moreover, this book can be used as teaching material for postgraduate students because, in addition to up-to-date descriptions of the applications, it includes exercises and their solutions. Some of the exercises mimic practical, real-life situations. Advanced students in graph theory, computer science or molecular epidemiology may use the problems and research methods presented in this book to develop their final-year projects, master’s theses or doctoral dissertations; however, to use the information effectively, special knowledge of graph theory would be required.

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.

scholarly journals Protein Structure Idealization: How accurately is it possible to model protein structures with dihedral angles?

2013 ◽  
Vol 8 (1) ◽  
pp. 5 ◽  
Author(s):  
Xuefeng Cui ◽  
Shuai Cheng Li ◽  
Dongbo Bu ◽  
Babak Alipanahi ◽  
Ming Li
Keyword(s):  
Protein Structure ◽  
Protein Structures ◽  
Dihedral Angles ◽  
Model Protein

scholarly journals Graph Theoretic Techniques in the Analysis of Uniquely Localizable Sensor Networks

2009 ◽  
pp. 146-173 ◽  
Author(s):  
Bill Jackson ◽  
Tibor Jordán
Keyword(s):  
Graph Theory ◽  
Sensor Networks ◽  
Optimization Problems ◽  
Partial Information ◽  
Two Dimensions ◽  
Localization Problem ◽  
Graph Theoretic ◽  
Network Localization ◽  
Exact Location ◽  
The Given

In the network localization problem the goal is to determine the location of all nodes by using only partial information on the pairwise distances (and by computing the exact location of some nodes, called anchors). The network is said to be uniquely localizable if there is a unique set of locations consistent with the given data. Recent results from graph theory and combinatorial rigidity made it possible to characterize uniquely localizable networks in two dimensions. Based on these developments, extensions, related optimization problems, algorithms, and constructions also became tractable. This chapter gives a detailed survey of these new results from the graph theorist’s viewpoint.

Sign in / Sign up

Export Citation Format

Share Document