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 条
  • [21] Tree-based classification and regression Part 3: Tree-based procedures
    Gunter, B
    QUALITY PROGRESS, 1998, 31 (02) : 121 - 123
  • [23] Tree-based differential evolution algorithm for QoS multicast routing
    Kong S.
    Chen Z.-Q.
    Journal of China Universities of Posts and Telecommunications, 2011, 18 (04): : 76 - 81
  • [24] Tree-Based Grammatical Evolution with Non-Encoding Nodes
    de la Cruz Lopez, Marina
    Garnica, Oscar
    Ignacio Hidalgo, J.
    PROCEEDINGS OF THE 2023 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION, GECCO 2023 COMPANION, 2023, : 63 - 64
  • [25] Resource-Efficient Parallel Tree-Based Join Architecture on FPGA
    Zhang, Huan
    Zhao, Bei
    Li, Wei-Jun
    Ma, Zhen-Guo
    Yu, Feng
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2019, 66 (01) : 111 - 115
  • [26] Architecture level optimization of 3-dimensional tree-based FPGA
    Pangracious, Vinod
    Amouri, Emna
    Marakchi, Zied
    Mehrez, Habib
    MICROELECTRONICS JOURNAL, 2014, 45 (04) : 355 - 366
  • [27] Tree-Based Codification in Neural Architecture Search for Medical Image Segmentation
    Fuentes-Tomas, Jose-Antonio
    Mezura-Montes, Efren
    Acosta-Mesa, Hector-Gabriel
    Marquez-Grajales, Aldo
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2024, 28 (03) : 597 - 607
  • [28] A tree-based Mergesort
    Moffat, A
    Petersson, O
    Wormald, NC
    ACTA INFORMATICA, 1998, 35 (09) : 775 - 793
  • [29] A Tree-based Mergesort
    Alistair Moffat
    Ola Petersson
    Nicholas C. Wormald
    Acta Informatica, 1998, 35 : 775 - 793
  • [30] Comparing performance of non–tree-based and tree-based association mapping methods
    Katherine L. Thompson
    David W. Fardo
    BMC Proceedings, 10 (Suppl 7)