Minimum conflict:: a divide-and-conquer approach to phylogeny estimation

被引:10
|
作者
Fuellen, G [1 ]
Wägele, JW
Giegerich, R
机构
[1] Ruhr Univ Bochum, Lehrstuhl Spez, D-44780 Bochum, Germany
[2] Univ Bielefeld, Tech Fak, D-33594 Bielefeld, Germany
[3] Univ Munster, Integrated Funct Genom, IZKF, D-48149 Munster, Germany
关键词
D O I
10.1093/bioinformatics/17.12.1168
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Motivation: Fast and reliable phylogeny estimation is rapidly gaining importance as more and more genomic sequence information is becoming available, and the study of the evolution of genes and genomes accelerates our understanding in biology and medicine alike. Branch attraction phenomena due to unequal amounts of evolutionary change in different parts of the phylogeny are one major problem for current methods, placing the species that evolved fast in one part of the phylogenetic tree, and the species that evolved slowly in the other. Results: We describe a way to avoid the artifactual attraction of species that evolved slowly, by detecting shared old character states using a calibrated comparison with an outgroup. The corresponding focus on shared novel character states yields a fast and transparent phylogeny estimation algorithm, by application of the divide-and-conquer principle, and heuristic search: shared novelties give evidence of the exclusive common heritage (monophyly) of a subset of the species. They indicate conflict in a split of all species considered, if the split tears them apart. Only the split at the root of the phylogenetic tree cannot have such conflict. Therefore, we can work top-down, from the root to the leaves, by heuristically searching for a minimum-conflict split, and tackling the resulting two subsets in the same way. The algorithm, called 'minimum conflict phylogeny estimation' (MCOPE), has been validated successfully using both natural and artificial data. In particular, we reanalyze published trees, yielding more plausible phylogenies, and we analyze small 'undisputed' trees on the basis of alignments considering structural homology.
引用
收藏
页码:1168 / 1178
页数:11
相关论文
共 50 条
  • [21] Matching large ontologies: A divide-and-conquer approach
    Hu, Wei
    Qu, Yuzhong
    Cheng, Gong
    DATA & KNOWLEDGE ENGINEERING, 2008, 67 (01) : 140 - 160
  • [22] The divide-and-conquer manifesto
    Dietterich, TG
    ALGORITHMIC LEARNING THEORY, PROCEEDINGS, 2000, 1968 : 13 - 26
  • [23] A Divide-and-Conquer Approach to Distributed Attack Identification
    Pasqualetti, Fabio
    Doerfler, Florian
    Bullo, Francesco
    2015 54TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2015, : 5801 - 5807
  • [24] A Divide-and-Conquer Approach to Commercial Territory Design
    Angelica Salazar-Aguilar, M.
    Luis Gonzalez-Velarde, J.
    Rios-Mercado, Roger Z.
    COMPUTACION Y SISTEMAS, 2012, 16 (03): : 309 - 320
  • [25] Multiview Hybrid Embedding: A Divide-and-Conquer Approach
    Xu, Jiamiao
    Yu, Shujian
    You, Xinge
    Leng, Mengjun
    Jing, Xiao-Yuan
    Chen, C. L. Philip
    IEEE TRANSACTIONS ON CYBERNETICS, 2020, 50 (08) : 3640 - 3653
  • [26] Parametric option pricing: A divide-and-conquer approach
    Gradojevic, Nikola
    Kukolj, Dragan
    PHYSICA D-NONLINEAR PHENOMENA, 2011, 240 (19) : 1528 - 1535
  • [27] Divide-and-Conquer Fusion
    Chan, Ryan S. Y.
    Pollock, Murray
    Johansen, Adam M.
    Roberts, Gareth O.
    JOURNAL OF MACHINE LEARNING RESEARCH, 2023, 24
  • [28] Divide-and-conquer approach for the exemplar breakpoint distance
    Nguyen, CT
    Tay, YC
    Zhang, LX
    BIOINFORMATICS, 2005, 21 (10) : 2171 - 2176
  • [29] A divide-and-conquer approach to acquire syntactic categories
    Gamallo, P
    Lopes, GP
    Da Silva, JF
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS, 2004, 3264 : 151 - 162
  • [30] HEADINGS, OR DIVIDE-AND-CONQUER
    DOLLE, R
    JOURNAL OF ENVIRONMENTAL HEALTH, 1990, 53 (03) : 56 - 56