• Title/Summary/Keyword: Protein Structure Prediction

Search Result 104, Processing Time 0.022 seconds

Backbone 1H, 15N, and 13C resonance assignments and secondary structure prediction of NifU-like protein, HP1492 from Helicobacter Pylori

  • Lee, Ki-Young;Kang, Su-Jin;Bae, Ye-Ji;Lee, Kyu-Yeon;Kim, Ji-Hun;Lee, Ingyun;Lee, Bong-Jin
    • Journal of the Korean Magnetic Resonance Society
    • /
    • v.17 no.2
    • /
    • pp.105-110
    • /
    • 2013
  • HP1492 is a NifU-like protein of Helicobacter pylori (H. pylori) and plays a role as a scaffold which transfer Fe-S cluster to Fe-S proteins like Ferredoxin. To understand how to bind to iron ion or iron-sulfur cluster, HP1492 was expressed and purified in Escherichia coli (E. coli). From the NMR measurement, we could carry out the sequence specific backbone resonance assignment of HP1492. Approximately 91% of all resonances could be assigned unambiguously. By analyzing results of CSI and TALOS from NMR data, we could predict the secondary structure of HP1492, which consists of three ${\alpha}$-helices and three ${\beta}$-sheets. This study is an essential step towards the structural characterization of HP1492.

Discovering Sequence Association Rules for Protein Structure Prediction (단백질 구조 예측을 위한 서열 연관 규칙 탐사)

  • Kim, Jeong-Ja;Lee, Do-Heon;Baek, Yun-Ju
    • The KIPS Transactions:PartD
    • /
    • v.8D no.5
    • /
    • pp.553-560
    • /
    • 2001
  • Bioinformatics is a discipline to support biological experiment projects by storing, managing data arising from genome research. In can also lead the experimental design for genome function prediction and regulation. Among various approaches of the genome research, the proteomics have been drawing increasing attention since it deals with the final product of genomes, i.e., proteins, directly. This paper proposes a data mining technique to predict the structural characteristics of a given protein group, one of dominant factors of the functions of them. After explains associations among amino acid subsequences in the primary structures of proteins, which can provide important clues for determining secondary or tertiary structures of them, it defines a sequence association rule to represent the inter-subsequences. It also provides support and confidence measures, newly designed to evaluate the usefulness of sequence association rules, After is proposes a method to discover useful sequence association rules from a given protein group, it evaluates the performance of the proposed method with protein sequence data from the SWISS-PROT protein database.

  • PDF

Implementation of Prototype for a Protein Motif Prediction and Update (단백질 모티프 예측 및 갱신 프로토 타입 구현)

  • Noh, Gi-Young;Kim, Wuon-Shik;Lee, Bum-Ju;Lee, Sang-Tae;Ryu, Keun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.11D no.4
    • /
    • pp.845-854
    • /
    • 2004
  • Motif databases are used in the function and structure prediction of proteins. The frequency of use about these databases increases continuously because of protein sequence data growth. Recently, many researches about motif resource integration are proceeding. However, existing motif databases were developed independently, thus these databases have a heterogeneous search result problem. Database intnegration for this problem resolution has a periodic update problem, a complex query process problem, a duplicate database entry handling problem and BML support problem. Therefore, in this paper, we suppose a database resource integration method for these problem resolution, describe periodically integrated database update method and XML transformation. finally, we estimate the implementation of our prototype and a case database.

Deciphering FEATURE for Novel Protein Data Analysis and Functional Annotation (단백질 구조 및 기능 분석을 위한 FEATURE 시스템 개선)

  • Yu, Seung-Hak;Yoon, Sung-Roh
    • Journal of IKEEE
    • /
    • v.13 no.3
    • /
    • pp.18-23
    • /
    • 2009
  • FEATURE is a computational method to recognize functional and structural sites for automatic protein function prediction. By profiling physicochemical properties around residues, FEATURE can characterize and predict functional and structural sites in 3D protein structures in a high-throughput manner. Despite its effectiveness, it has been challenging to apply FEATURE to novel protein data due to limited customization support. To address this problem, we thoroughly analyze the internal modules of FEATURE and propose a methodology to customize FEATURE so that it can be used for new protein data for automatic functional annotations.

  • PDF

Analysis of a Large-scale Protein Structural Interactome: Ageing Protein structures and the most important protein domain

  • Bolser, Dan;Dafas, Panos;Harrington, Richard;Schroeder, Michael;Park, Jong
    • Proceedings of the Korean Society for Bioinformatics Conference
    • /
    • 2003.10a
    • /
    • pp.26-51
    • /
    • 2003
  • Large scale protein interaction maps provide a new, global perspective with which to analyse protein function. PSIMAP, the Protein Structural Interactome Map, is a database of all the structurally observed interactions between superfamilies of protein domains with known three-dimensional structure in thePDB. PSIMAP incorporates both functional and evolutionary information into a single network. It makes it possible to age protein domains in terms of taxonomic diversity, interaction and function. One consequence of it is to predict the most important protein domain structure in evolution. We present a global analysis of PSIMAP using several distinct network measures relating to centrality, interactivity, fault-tolerance, and taxonomic diversity. We found the following results: ${\bullet}$ Centrality: we show that the center and barycenter of PSIMAP do not coincide, and that the superfamilies forming the barycenter relate to very general functions, while those constituting the center relate to enzymatic activity. ${\bullet}$ Interactivity: we identify the P-loop and immunoglobulin superfamilies as the most highly interactive. We successfully use connectivity and cluster index, which characterise the connectivity of a superfamily's neighbourhood, to discover superfamilies of complex I and II. This is particularly significant as the structure of complex I is not yet solved. ${\bullet}$ Taxonomic diversity: we found that highly interactive superfamilies are in general taxonomically very diverse and are thus amongst the oldest. This led to the prediction of the oldest and most important protein domain in evolution of lift. ${\bullet}$ Fault-tolerance: we found that the network is very robust as for the majority of superfamilies removal from the network will not break up the network. Overall, we can single out the P-loop containing nucleotide triphosphate hydrolases superfamily as it is the most highly connected and has the highest taxonomic diversity. In addition, this superfamily has the highest interaction rank, is the barycenter of the network (it has the shortest average path to every other superfamily in the network), and is an articulation vertex, whose removal will disconnect the network. More generally, we conclude that the graph-theoretic and taxonomic analysis of PSIMAP is an important step towards the understanding of protein function and could be an important tool for tracing the evolution of life at the molecular level.

  • PDF

A Study on the Detection of Similarity GPCRs by using protein Secondary structure (단백질 2차 구조를 이용한 유사 GPCR 검출에 관한 연구)

  • Ku, Ja-Hyo;Han, Chan-Myung;Yoon, Young-Woo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.1
    • /
    • pp.73-80
    • /
    • 2009
  • G protein-coupled receptors(GPCRs) family is a cell membrane protein, and plays an important role in a signaling mechanism which transmits external signals through cell membranes into cells. But, GPCRs each are known to have various complex control mechanisms and very unique signaling mechanisms. Structural features, and family and subfamily of GPCRs are well known by function. and accordingly, the most fundamental work in studies identifying the previous GPCRs is to classify the GPCRs with given protein sequences. Studies for classifying previously identified GPCRs more easily with mathematical models have been mainly going on. In this paper Considering that functions of proteins are determined by their stereoscopic structures, the present paper proposes a method to compare secondary structures of two GPCRs having different amino acid sequences, and then detect an unknown GPCRs assumed to have a same function in databases of previously identified GPCRs.

Demand Analysis of Fresh-fish in the Urban Communities (도시지역에 있어서 선어의 수요분석 -육류와의 대체관계를 중심으로-)

  • 김수관
    • The Journal of Fisheries Business Administration
    • /
    • v.15 no.1
    • /
    • pp.114-130
    • /
    • 1984
  • The structure of food demand is being changed according to the improvement of living standard. Moreover, the intake of animal protein is stepping up. This paper considers how much fresh-fish is consumed as source of animal protein and what extent fresh-fish have substitutive relation for meat with special reference to the change of income and price of fresh-fish and meat. And it is thought to be important work to estimate demand of fresh-fish in attemps to the prediction of food consume pattern and fishing industries in the future. For this estimation, the substitutive relation of fresh-fish and meat is essentially studied. The main conclusions of this study can be drawn as follows: 1. Fresh-fish and meat have substitutive relation on price axis. By the way, increase in demand of A (fresh-fish which have comparatively low price) can be expected according to the low of it's price against meat, but B (fresh-fish wihich have comparatively middle-high price) have peculiar demand without substitutive relation for meat. 2. Demand of A and B rise according to the income increases. 3. It is not sufficient to explain substutive relation of fresh-fish and meat without income variable. 4. Income increases bring about the more increase in demand of B than A. By the way, price increases bring about the decrease of it's consume expenditure, but A have fundamental demand as the source of animal protein. 5. In future, the intake of animal protein will step up. By the way, meat will occupy the more portion of the source of animal protein than fresh-fish.

  • PDF

Protein Function Finding Systems through Domain Analysis on Protein Hub Network (단백질 허브 네트워크에서 도메인분석을 통한 단백질 기능발견 시스템)

  • Kang, Tae-Ho;Ryu, Jea-Woon;Kim, Hak-Yong;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.1
    • /
    • pp.259-271
    • /
    • 2008
  • We propose a protein function finding algorithm that is able to predict specific molecular function for unannotated proteins through domain analysis from protein-protein network. To do this, we first construct protein-protein interaction(PPI) network in Saccharomyces cerevisiae from MIPS databases. The PPI network(proteins; 3,637, interactions; 10,391) shows the characteristics of a scale-free network and a hierarchical network that proteins with a number of interactions occur in small and the inherent modularity of protein clusters. Protein-protein interaction databases obtained from a Y2H(Yeast Two Hybrid) screen or a composite data set include random false positives. To filter the database, we reconstruct the PPI networks based on the cellular localization. And then we analyze Hub proteins and the network structure in the reconstructed network and define structural modules from the network. We analyze protein domains from the structural modules and derive functional modules from them. From the derived functional modules with high certainty, we find tentative functions for unannotated proteins.

Search Space Reduction Techniques in Small Molecular Docking (소분자 도킹에서 탐색공간의 축소 방법)

  • Cho, Seung Joo
    • Journal of Integrative Natural Science
    • /
    • v.3 no.3
    • /
    • pp.143-147
    • /
    • 2010
  • Since it is of great importance to know how a ligand binds to a receptor, there have been a lot of efforts to improve the quality of prediction of docking poses. Earlier efforts were focused on improving search algorithm and scoring function in a docking program resulting in a partial improvement with a lot of variations. Although these are basically very important and essential, more tangible improvements came from the reduction of search space. In a normal docking study, the approximate active site is assumed to be known. After defining active site, scoring functions and search algorithms are used to locate the expected binding pose within this search space. A good search algorithm will sample wisely toward the correct binding pose. By careful study of receptor structure, it was possible to prioritize sub-space in the active site using "receptor-based pharmacophores" or "hot spots". In a sense, these techniques reduce the search space from the beginning. Further improvements were made when the bound ligand structure is available, i.e., the searching could be directed by molecular similarity using ligand information. This could be very helpful to increase the accuracy of binding pose. In addition, if the biological activity data is available, docking program could be improved to the level of being useful in affinity prediction for a series of congeneric ligands. Since the number of co-crystal structures is increasing in protein databank, "Ligand-Guided Docking" to reduce the search space would be more important to improve the accuracy of docking pose prediction and the efficiency of virtual screening. Further improvements in this area would be useful to produce more reliable docking programs.

Analysis, Detection and Prediction of some of the Structural Motifs in Proteins

  • Guruprasad, Kunchur
    • Proceedings of the Korean Society for Bioinformatics Conference
    • /
    • 2005.09a
    • /
    • pp.325-330
    • /
    • 2005
  • We are generally interested in the analysis, detection and prediction of structural motifs in proteins, in order to infer compatibility of amino acid sequence to structure in proteins of known three-dimensional structure available in the Protein Data Bank. In this context, we are analyzing some of the well-characterized structural motifs in proteins. We have analyzed simple structural motifs, such as, ${\beta}$-turns and ${\gamma}$-turns by evaluating the statistically significant type-dependent amino acid positional preferences in enlarged representative protein datasets and revised the amino acid preferences. In doing so, we identified a number of ‘unexpected’ isolated ${\beta}$-turns with a proline amino acid residue at the (i+2) position. We extended our study to the identification of multiple turns, continuous turns and to peptides that correspond to the combinations of individual ${\beta}$ and ${\gamma}$-turns in proteins and examined the hydrogen-bond interactions likely to stabilize these peptides. This led us to develop a database of structural motifs in proteins (DSMP) that would primarily allow us to make queries based on the various fields in the database for some well-characterized structural motifs, such as, helices, ${\beta}$-strands, turns, ${\beta}$-hairpins, ${\beta}$-${\alpha}$-${\beta}$, ${\psi}$-loops, ${\beta}$-sheets, disulphide bridges. We have recently implemented this information for all entries in the current PDB in a relational database called ODSMP using Oracle9i that is easy to update and maintain and added few additional structural motifs. We have also developed another relational database corresponding to amino acid sequences and their associated secondary structure for representative proteins in the PDB called PSSARD. This database allows flexible queries to be made on the compatibility of amino acid sequences in the PDB to ‘user-defined’ super-secondary structure conformation and vice-versa. Currently, we have extended this database to include nearly 23,000 protein crystal structures available in the PDB. Further, we have analyzed the ‘structural plasticity’ associated with the ${\beta}$-propeller structural motif We have developed a method to automatically detect ${\beta}$-propellers from the PDB codes. We evaluated the accuracy and consistency of predicting ${\beta}$ and ${\gamma}$-turns in proteins using the residue-coupled model. I will discuss results of our work and describe databases and software applications that have been developed.

  • PDF