Domain tree-based analysis of protein architecture evolution

被引:72
|
作者
Forslund, Kristoffer [1 ]
Henricson, Anna [2 ]
Hollich, Volker [2 ]
Sonnhammer, Erik L. L. [1 ]
机构
[1] Stockholm Univ, Stockholm Bioinformat Ctr, S-10691 Stockholm, Sweden
[2] Karolinska Inst, Dept Cell & Mol Biol, Stockholm, Sweden
关键词
protein; domain; architecture; evolution;
D O I
10.1093/molbev/msm254
中图分类号
Q5 [生物化学]; Q7 [分子生物学];
学科分类号
071010 ; 081704 ;
摘要
Understanding the dynamics behind domain architecture evolution is of great importance to unravel the functions of proteins. Complex architectures have been created throughout evolution by rearrangement and duplication events. An interesting question is how many times a particular architecture has been created, a form of convergent evolution or domain architecture reinvention. Previous studies have approached this issue by comparing architectures found in different species. We wanted to achieve a finer-grained analysis by reconstructing protein architectures on complete domain trees. The prevalence of domain architecture reinvention in 96 genomes was investigated with a novel domain tree-based method that uses maximum parsimony for inferring ancestral protein architectures. Domain architectures were taken from Pfam. To ensure robustness, we applied the method to bootstrap trees and only considered results with strong statistical support. We detected multiple origins for 12.4% of the scored architectures. In a much smaller data set, the subset of completely domain-assigned proteins, the figure was 5.6%. These results indicate that domain architecture reinvention is a much more common phenomenon than previously thought. We also determined which domains are most frequent in multiply created architectures and assessed whether specific functions could be attributed to them. However, no strong, functional bias was found in architectures with multiple origins.
引用
收藏
页码:254 / 264
页数:11
相关论文
共 50 条
  • [31] A Decision Tree-Based Method for Protein Contact Map Prediction
    Santiesteban Toca, Cosme Ernesto
    Marquez Chamorro, Alfonso E.
    Asencio Cortes, Gualberto
    Aguilar-Ruiz, Jesus S.
    EVOLUTIONARY COMPUTATION, MACHINE LEARNING AND DATA MINING IN BIOINFORMATICS, 2011, 6623 : 153 - 158
  • [32] A Tree-based Search to Bias Sampling of Protein Decoy Conformations
    Molloy, Kevin
    Shehu, Amarda
    2012 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE WORKSHOPS (BIBMW), 2012,
  • [33] Performance Analysis of Tree-Based Approaches for Pattern Mining
    Borah, Anindita
    Nath, Bhabesh
    COMPUTATIONAL INTELLIGENCE IN DATA MINING, 2019, 711 : 435 - 448
  • [34] A bandwidth analysis of tree-based reliable multicast protocols
    Maihöfer, C
    Rothermel, K
    SCALABILITY AND TRAFFIC CONTROL IN IP NETWORKS, 2001, 4526 : 354 - 368
  • [35] Tree-based WCET analysis on instrumentation point graphs
    Betts, Adam
    Bernat, Guillem
    NINTH IEEE INTERNATIONAL SYMPOSIUM ON OBJECT AND COMPONENT-ORIENTED REAL-TIME DISTRIBUTED COMPUTING, PROCEEDINGS, 2006, : 558 - 565
  • [36] Collision frequency analysis using tree-based stratification
    Park, YJ
    Saccomanno, FF
    STATISTICAL METHODS; HIGHWAY SAFETY DATA, ANALYSIS, AND EVALUATION; OCCUPANT PROTECTION; SYSTEMATIC REVIEWS AND META-ANALYSIS, 2005, (1908): : 121 - 129
  • [37] A Tree-Based Approach for Efficient and Accurate Conjunction Analysis
    Mercurio, Michael
    Singla, Puneet
    CMES-COMPUTER MODELING IN ENGINEERING & SCIENCES, 2016, 111 (03): : 229 - 256
  • [38] Developing a Library of Tree-Based Models for Survival Analysis
    I. A. Vasilev
    Moscow University Computational Mathematics and Cybernetics, 2024, 48 (3) : 190 - 202
  • [39] A delay analysis of tree-based reliable multicast protocols
    Maihöfer, C
    Rothermel, K
    TENTH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, PROCEEDINGS, 2001, : 274 - 281
  • [40] A tree-based approach for efficient and accurate conjunction analysis
    Mercurio, Michael
    Singla, Puneet
    CMES - Computer Modeling in Engineering and Sciences, 2016, 111 (03): : 229 - 256