Toward the unification of sequence and structural data for identification of structural and functional constraints

The identification and characterization of local residue patterns or conserved segments shared by a set of biopolymers has provided a number of insights in molecular biology. Biopolymer sequences are observations from macro molecules that share common structural or function features. The approach taken here rests on the notion that information may be most efficiently extracted from these observations through the use of a model that faithfully represents macro-molecular characteristics. Accordingly, our efforts are focused on statistical models which attempt to capture central features of protein structure, function, and change. Here the assumptions that underlie two new methods for the analysis of protein sequence data are explicitly delineated. (1) Threading of a sequence through structural motifs seeks to determine if a protein sequence fits a known protein structure. The assumptions delineated here also generally apply to other contact based threading methods that have been recently described. (2) Multiple sequence alignment via the Gibbs sampling algorithm seeks to identify position specific empirical free energy models for residue sites in common motifs and simultaneously the align sequence observations form these motifs.     

Amino acid residue environments and predictions of residue type.

The determination of a protein's structure from the knowledge of its linear chain is one of the important problems that remains as a bottleneck in interpreting the rapidly increasing repository of genetic sequence data. One approach to this problem that has shown promise and given a measure of success is threading. In this approach contact energies between different amino acids are first determined by statistical methods applied to known structures. These contact energies are then applied to a sequence whose structure is to be determined by threading it through various known structures and determining the total threading energy for each candidate structure. That structure that yields the lowest total energy is then considered the leading candidate among all the structures tested. Additional information is often needed in order to support the results of threading studies, as it is well known in the field that the contact potentials used are not sufficiently sensitive to allow definitive conclusions. Here, we investigate the hypothesis that the environment of an amino acid residue realized as all those residues not local to it on the chain but sufficiently close spatially can supply information predictive of the type of that residue that is not adequately reflected in the individual contact energies. We present evidence that confirms this hypothesis and suggests a high order cooperativity between the residues that surround a given residue and how they interact with it. We suggest a possible application to threading.     

An Algorithm for Simultaneous Backbone Threading and Side-Chain Packing

To utilize fully all available information in protein structure prediction, including both backbone and side-chain structures, we present a novel algorithm for solving a generalized threading problem. In this problem we consider simultaneous backbone threading and side-chain packing during the process of a protein structure prediction. For a given query protein sequence and a template structure, our goal is to find a threading alignment between the query sequence and the template structure, along with a rotamer assignment for each side-chain of the query protein, which optimizes an energy function that combines a backbone threading energy and a side-chain packing energy. This highly computationally challenging problem is solved through first formulating this problem as a graph-based optimization problem. Various graph-theoretic techniques are employed to achieve the computational efficiency to make our algorithm practically useful, which takes advantage of a number of special properties of the graph representing this generalized threading problem. The overall framework of our algorithm is a dynamic programming algorithm implemented on an optimal tree decomposition of the graph representation of our problem. By using various additional heuristic techniques such as dead-end elimination, we have demonstrated that our algorithm can solve a generalized threading problem within a practically acceptable amount of time and space, the first of its kind.     

An Algorithm for Simultaneous Backbone Threading and Side-Chain Packing

To fully utilize all available information in protein structure prediction, including both backbone and side-chain structures, we present a novel algorithm for solving a generalized threading problem. In this problem, we consider simultaneously backbone threading and side-chain packing during the process of a protein structure prediction. For a given query protein sequence and a template structure, our goal is to find a threading alignment between the query sequence and the template structure, along with a rotamer assignment for each side-chain of the query protein, which optimizes an energy function that combines a backbone threading energy and a side-chain packing energy. This highly computationally challenging problem is solved through first formulating this problem as a graph-based optimization problem. Various graph-theoretic techniques are employed to achieve the computational efficiency to make our algorithm practically useful, which takes advantage of a number of special properties of the graph representing this generalized threading problem. The overall framework of our algorithm is a dynamic programming algorithm implemented on an optimal tree decomposition of the graph representation of our problem. By using various additional heuristic techniques such as the dead-end elimination, we have demonstrated that our algorithm can solve a generalized threading problem within practically acceptable amount of time and space, the first of its kind.     

Practical evaluation of comparative modelling and threading methods

Six protein pairs, all with known 3D-structures, were used to evaluate different protein structure prediction tools. Firstly, alignments between a target sequence and a template sequence or structure were obtained by sequence alignment with QUANTA or by threading with THREADER, 123D and PHD Topits. Secondly, protein structure models were generated using MODELLER. The two protein structure assessment tools used were the root mean square deviation (RMSD) compared with the experimental target structure and the total 3D profile score. Also the accuracy of the active sites of models built in the absence and presence of ligands was investigated. Our study confirms that threading methods are able to yield more accurate models than comparative modelling in cases of low sequence identity (<30%). However, a gap of 2 Å(RMSD) exists between the theoretically best model and the models obtained by threading methods. For high sequence identities (>30%) comparative modelling using MODELLER resulted in accurate models. Furthermore, the total 3D profile score was not always able to distinguish correct from incorrect folds when different alignment methods were used. Finally, we found it to be important to include possible ligands in the model-building process in order to prevent unrealistic filling of active site areas.     

Genetic Threading

The biological function of proteins is dependent, to a large extent, on their native three dimensional conformation. Thus, it is important to know the structure of as many proteins as possible. Since experimental methods for structure determination are very tedious, there is a significant effort to calculate the structure of a protein from its linear sequence. Direct methods of calculating structure from sequence are not available yet. Thus, an indirect approach to predict the conformation of protein, called threading, is discussed. In this approach, known structures are used as constraints, to restrict the search for the native conformation. Threading requires finding good alignments between a sequence and a structure, which is a major computational challenge and a practical bottleneck in applying threading procedures. The Genetic Algorithm paradigm, an efficient search method that is based on evolutionary ideas, is used to perform sequence to structure alignments. A proper representation is discussed in which genetic operators can be effectively implemented. The algorithm performance is tested for a set of six sequence/structure pairs. The effects of changing operators and parameters are explored and analyzed.     

Parallel evolution strategy on grids for the protein threading problem

The protein threading problem is the problem of determining the three-dimensional structure of a given but arbitrary protein sequence from a set of known structures of other proteins. This problem is known to be NP-hard and current computational approaches to threading are unrealistic for long proteins and/or large template data sets. In this paper, we propose an evolution strategy for the solution of the protein threading problem. We also propose three parallel methods for fast threading. Our experiments produced encouraging preliminary results in term of threading energy as well as significant reduction in threading time.     

基于贝叶斯网的蛋白质相互作用位点预测

蛋白质相互作用位点研究在蛋白质功能分析及药物设计等方面有着重要的应用。文章以蛋白质中的氨基酸残基为研究对象,使用残基的溶剂可及表面积、进化保守性打分及残基的序列信息熵三个特征为特征集,构建了基于贝叶斯方法的蛋白质相互作用位点预测的贝叶斯分类预测器。方法有效的结合了蛋白质残基特征数据集经常性数据缺失的特点及贝叶斯网在处理不确定性数据方面的优点,通过对基准的71个蛋白质数据集进行实验,结果表明我们的分类器预测的有效性。     

Continuous anisotropic representation of coarse-grained potentials for proteins by spherical harmonics synthesis

A new method is presented for extracting statistical potentials dependent on the relative side chain and backbone orientations in proteins. Coarse-grained, anisotropic potentials are constructed for short-, medium-, and long-range interactions using the Boltzmann method and a database of non-homologous protein structures. The new orientation-dependent potentials are analyzed using a spherical harmonics decomposition method with real eigenfunctions. This method permits a more realistic, continuous angular representation of the coarse-grained potentials. Results of tests for discriminating the native protein conformations from large sets of decoy proteins, show that the new continuous distance- and orientation-dependent potentials present significantly improved performance. Novel graphical representations are developed and used to depict the orientational dependence of the interaction potentials. These new continuous anisotropic statistical potentials could be instrumental in developing new computational methods for structure prediction, threading and coarse-grained simulations.     

引入序列信息的残基相互作用网络比对算法

残基相互作用网络比对,对于研究蛋白质结构与功能的关系具有重要意义.在基于网络拓扑信息进行网络比对的MAGNA算法基础上,将蛋白质的序列信息（即残基匹配度）引入到其优化函数中,确定拓扑信息和序列信息对比对的影响程度,提出适合于残基相互作用网络比对的SI-MAGNA算法.实验结果表明,SI-MAGNA算法比现有的基于网络拓扑信息的经典比对方法（GRAAL、MI-GRAAL、MAGNA和CytoGEDEVO）具有更高的边正确性（edge correctness,简称EC）.最后,使用SI-MAGNA算法对来自不同耐热温度的生物的同源蛋白质进行网络比对和分析,探索蛋白质结构对其热稳定性的影响.     

MINLP‐based hybrid strategy for operating mode selection of TES‐backed‐up refrigeration systems

This brief deals with the satisfaction of the daily cooling demand by a hybrid system that consists of a vapor‐compression refrigeration cycle and a thermal energy storage (TES) unit, based on phase change materials. The addition of the TES tank to the original refrigeration plant allows to schedule the cooling production regardless of the instantaneous demand, given that the TES tank can store cold energy and release it whenever deemed appropriate. The scheduling problem is posed as an optimization problem based on mixed‐integer nonlinear programming (MINLP) since it includes both discrete and continuous variables. The latter corresponds to the references on the main cooling powers involved in the problem (cooling production at the evaporator and TES charging/discharging), whereas the discrete variables define the operating mode scheduling. Therefore, in addition to the hybrid features of the physical plant, a hybrid optimal control strategy is also proposed. A receding horizon approach is applied, similar to model predictive control (MPC) strategies, while economic criteria are imposed in the objective function, as well as feasibility issues. The TES state estimation is also addressed since its instantaneous charge ratio is not measurable. The proposed strategy is applied in simulation to a challenging cooling demand profile, and the main advantages of the MINLP‐based strategy over a nonlinear MPC‐based scheduling strategy previously developed are highlighted, regarding operating cost, ease of tuning, and ability to adapt to cooling demand variations.     

蛋白质二级结构预测方法研究

为提高蛋白质二级结构预测精度,提出一种新的网络模型和编码方法。首先利用基因表达式编程（GEP）的全局搜索能力同时进化设计神经网络的结构和连接权;其次,对神经网络输入层编码进行了改进,添加了氨基酸残基所处的疏水环境。用PDBSelect25中的36条蛋白质共6 122个残基进行测试,结果表明提出的网络模型和编码方法能有效提高蛋白质二级结构预测的精度。     

A simple method for protein structural classification

Since the concept of structural classes of proteins was proposed, the problem of protein classification has been tackled by many groups. Most of their classification criteria are based only on the helix/strand contents of proteins. In this paper, we proposed a method for protein structural classification based on their secondary structure sequences. It is a classification scheme that can confirm existing classifications. Here a mathematical model is constructed to describe protein secondary structure sequences, in which each protein secondary structure sequence corresponds to a transition probability matrix that characterizes and differentiates protein structure numerically. Its application to a set of real data has indicated that our method can classify protein structures correctly. The final classification result is shown schematically. So it is visual to observe the structural classifications, which is different from traditional methods.     

Predicting protein secondary structure using a mixed-modal SVM method in a compound pyramid model

Accurate protein secondary structure prediction plays an important role in direct tertiary structure modeling, and can also significantly improve sequence analysis and sequence-structure threading for structure and function determination. Hence improving the accuracy of secondary structure prediction is essential for future developments throughout the field of protein research.In this article, we propose a mixed-modal support vector machine (SVM) method for predicting protein secondary structure. Using the evolutionary information contained in the physicochemical properties of each amino acid and a position-specific scoring matrix generated by a PSI-BLAST multiple sequence alignment as input for a mixed-modal SVM, secondary structure can be predicted at significantly increased accuracy. Using a Knowledge Discovery Theory based on the Inner Cognitive Mechanism (KDTICM) method, we have proposed a compound pyramid model, which is composed of three layers of intelligent interface that integrate a mixed-modal SVM (MMS) module, a modified Knowledge Discovery in Databases (KDD1) process, a mixed-modal back propagation neural network (MMBP) module and so on.Testing against data sets of non-redundant protein sequences returned values for the Q₃ accuracy measure that ranged from 84.0% to 85.6%,while values for the SOV99 segment overlap measure ranged from 79.8% to 80.6%. When compared using a blind test dataset from the CASP8 meeting against currently available secondary structure prediction methods, our new approach shows superior accuracy.Availability: http://www.kdd.ustb.edu.cn/protein_Web/.     

基于语音结构化模型的数字语音识别

提出一种新的基于语音结构化模型的语音识别方法,并应用于非特定人数字语音识别.每一个数字语音计算倒谱特征之后提取语音中存在的对说话人差异具有不变性的结构化特征——全局声学结构(acoustical universal structure,AUS),并建立结构化模型,识别时提取测试语音的全局声学结构,然后与各数字语音的结构化模型进行匹配.测试了少量语料训练下的识别性能并与传统HMM (hidden Markov model)方法进行比较,结果表明该方法可以取得优于HMM的性能,语音结构化模型可以有效消除说话人之间的差异.     

A simple method for protein structural classification

Since the concept of structural classes of proteins was proposed, the problem of protein classification has been tackled by many groups. Most of their classification criteria are based only on the helix/strand contents of proteins. In this paper, we proposed a method for protein structural classification based on their secondary structure sequences. It is a classification scheme that can confirm existing classifications. Here a mathematical model is constructed to describe protein secondary structure sequences, in which each protein secondary structure sequence corresponds to a transition probability matrix that characterizes and differentiates protein structure numerically. Its application to a set of real data has indicated that our method can classify protein structures correctly. The final classification result is shown schematically. So it is visual to observe the structural classifications, which is different from traditional methods.     

电网设备能效综合评估算法及其应用

为了降低电网能耗,为其设备优化升级提供指导,以电网主要设备为研究对象,建立了能效综合评估算法。首先分析电网设备能效影响因素,建立设备能效模型,从单类设备综合损耗率与单台设备损耗率严重超标台数率两个方面挖掘能效指标并给出指标计算方法。考虑到各指标对能效影响的重要程度是多方面的,建立递阶层次结构模型,采用层次分析法计算指标的权重值,同时采用模糊综合评价法计算指标的能效量化分值,以克服其模糊性。采用所建立的算法对某电网的主要设备进行能效分析评估,结果表明了该方法的实用性和有效性。     

Multiple protein sequence alignment using double-dynamic programming

A method of multiple sequence alignment is described based on the double dynamic programming (DDP) algorithm previously used for treating structural constraints encountered in structure comparison and threading. Following these applications, the inconsistencies that emerge when trying to combine pair-wise alignments into a multiple alignment are reconciled by summing all the, possibly inconsistent, paths (low-level alignments) into a matrix which is then used to provide a final (high-level) alignment. This process is applied to all sequence pairs and the pair-wise results combined in a simple multiple sequence alignment program. From this alignment, further constraints are selected to bias the low-level alignments in the DDP algorithm and the process iterated. The results, however, showed that this overall iteration was not needed and one-pass gave results at least as good as the 'standard' progressive method of multiple sequence alignment. Further applications of the method are discussed.     

Contribution of main chain and side chain atoms and their locations to the stability of thermophilic proteins

Proteins belonging to the same class, having similar structures thus performing the same function are known to have different thermal stabilities depending on the source— thermophile or mesophile. The variation in thermo-stability has not been attributed to any unified factor yet and understanding this phenomenon is critically needed in several areas, particularly in protein engineering to design stable variants of the proteins. Toward this motive, the present study focuses on the sequence and structural investigation of a dataset of 373 pairs of proteins; a thermophilic protein and its mesophilic structural analog in each pair, from the perspectives of hydrophobic free energy, hydrogen bonds, physico-chemical properties of amino acids and residue–residue contacts. Our results showed that the hydrophobic free energy due to carbon, charged nitrogen and charged oxygen atoms was stronger in 65% of thermophilic proteins. The number of hydrogen bonds which bridges the buried and exposed regions of proteins was also greater in case of thermophiles. Amino acids of extended shape, volume and molecular weight along with more medium and long range contacts were observed in many of the thermophilic proteins. These results highlight the preference of thermophiles toward the amino acids with larger side chain and charged to make up greater free energy, better packing of residues and increase the overall compactness.     

Molecular modeling study on the effect of residues distant from the nucleotide-binding portion on RNA binding in Staphylococcus aureus Hfq

Hfq is an abundant RNA-binding bacterial protein that was first identified in E. coli as a required host factor for phage Qβ RNA replication. The pleiotrophic phenotype resulting from the deletion of Hfq predicates the importance of this protein. Two RNA-binding sites have been characterized: the proximal site which binds sRNA and mRNA and the distal site which binds poly(A) tails. Previous studies mainly focused on the key residues in the proximal site of the protein. A recent mutation study in E. coli Hfq showed that a distal residue Val43 is important for the protein function. Interestingly, when we analyzed the sequence and structure of Staphylococcus aureus Hfq using the CONSEQ server, the results elicited that more functional residues were located far from the nucleotide-binding portion (NBP). From the analysis seven individual residues Asp9, Leu12, Glu13, Lys16, Gln31, Gly34 and Asp40 were selected to investigate the conformational changes in Hfq–RNA complex due to point mutation effect of those residues using molecular dynamics simulations. Results showed a significant effect on Asn28 which is an already known highly conserved functionally important residue. Mutants D9A, E13A and K16A depicted effects on base stacking along with increase in RNA pore diameter, which is required for the threading of RNA through the pore for the post-translational modification. Further, the result of protein stability analysis by the CUPSAT server showed destabilizing effect in the most mutants. From this study we characterized a series of important residues located far from the NBP and provide some clues that those residues may affect sRNA binding in Hfq.