Mining of protein contact maps for protein fold prediction

被引:10
|
作者
Bhavani, Durga [1 ]
Suvarnavani, K. [2 ]
Sinha, Somdatta [3 ]
机构
[1] Univ Hyderabad, Dept Comp & Informat Sci, Hyderabad 500134, Andhra Pradesh, India
[2] VR Siddhartha Engn Coll, Dept Comp Sci & Engn, Vijayawada, Andhra Pradesh, India
[3] Ctr Cellular & Mol Biol, Hyderabad 500007, Andhra Pradesh, India
关键词
SUPPORT VECTOR MACHINES; CLASSIFICATION; RECOGNITION; NETWORKS; SPACE; PAIRS; SCOP;
D O I
10.1002/widm.35
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The three-dimensional structure of proteins is useful to carry out the biophysical and biochemical functions in a cell. Approaches to protein structure/fold prediction typically extract amino acid sequence features, and machine learning approaches are then applied to classification problem. Protein contact maps are two-dimensional representations of the contacts among the amino acid residues in the folded protein structure. This paper highlights the need for a systematic study of these contact networks. Mining of contact maps to derive features pertaining to fold information offers a new mechanism for fold discovery from the protein sequence via the contact maps. These ideas are explored in the structural class of all-alpha proteins to identify structural elements. A simple and computationally inexpensive algorithm based on triangle subdivision method is proposed to extract additional features from the contact map. The method successfully characterizes the off-diagonal interactions in the contact map for predicting specific 'folds'. The decision tree classification results show great promise in developing a new and simple tool for the challenging problem of fold prediction. (C) 2011 John Wiley & Sons, Inc. WIREs Data Mining Knowl Discov 2011 1 362-368 DOI:10.1002/widm.35
引用
收藏
页码:362 / 368
页数:7
相关论文
共 50 条
  • [1] Protein fold recognition and dynamics in the space of contact maps
    Mirny, L
    Domany, E
    [J]. PROTEINS-STRUCTURE FUNCTION AND GENETICS, 1996, 26 (04): : 391 - 410
  • [2] Frequent substructures and fold classification from protein contact maps
    Vani, Suvarna K.
    Swaroopa, M. Om
    Sravani, T. D.
    Kumar, K. Praveen
    [J]. 2014 IEEE CONFERENCE ON COMPUTATIONAL INTELLIGENCE IN BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, 2014,
  • [3] Protein fold identification using machine learning methods on contact maps
    Vani, K. Suvarna
    Kumar, K. Praveen
    [J]. 2016 IEEE CONFERENCE ON COMPUTATIONAL INTELLIGENCE IN BIOINFORMATICS AND COMPUTATIONAL BIOLOGY (CIBCB), 2016,
  • [4] PREDICTION OF CHIMERIC PROTEIN FOLD
    Acuna, Ruben
    Lacroix, Zoe
    Hadji, Fayez
    Chomilier, Jacques
    Papandreou, Nikolaos
    [J]. BIOINFORMATICS: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON BIOINFORMATICS MODELS, METHODS AND ALGORITHMS, 2012, : 234 - 239
  • [5] Directionality in protein fold prediction
    Jonathan J Ellis
    Fabien PE Huard
    Charlotte M Deane
    Sheenal Srivastava
    Graham R Wood
    [J]. BMC Bioinformatics, 11
  • [6] Directionality in protein fold prediction
    Ellis, Jonathan J.
    Huard, Fabien P. E.
    Deane, Charlotte M.
    Srivastava, Sheenal
    Wood, Graham R.
    [J]. BMC BIOINFORMATICS, 2010, 11
  • [7] Triage protein fold prediction
    He, HX
    McAllister, G
    Smith, TF
    [J]. PROTEINS-STRUCTURE FUNCTION AND GENETICS, 2002, 48 (04): : 654 - 663
  • [8] An On/Off Lattice Approach to Protein Structure Prediction from Contact Maps
    Teso, Stefano
    Di Risio, Cristina
    Passerini, Andrea
    Battiti, Roberto
    [J]. PATTERN RECOGNITION IN BIOINFORMATICS, 2010, 6282 : 368 - 379
  • [9] Evolutionary Protein Contact Maps Prediction Based on Amino Acid Properties
    Marquez Chamorro, Alfonso E.
    Divina, Federico
    Aguilar-Ruiz, Jesus S.
    [J]. HYBRID ARTIFICIAL INTELLIGENT SYSTEMS, PART II, 2011, 6679 : 303 - 310
  • [10] Mining sequential patterns for protein fold recognition
    Exarchos, Themis P.
    Papaloukas, Costas
    Lampros, Christos
    Fotiadis, Dimitrios I.
    [J]. JOURNAL OF BIOMEDICAL INFORMATICS, 2008, 41 (01) : 165 - 179