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 条
  • [31] MULTIDIMENSIONAL DIVIDE-AND-CONQUER
    BENTLEY, JL
    COMMUNICATIONS OF THE ACM, 1980, 23 (04) : 214 - 229
  • [32] A Divide-and-Conquer Genetic-Fuzzy Mining Approach for Items with Multiple Minimum Supports
    Chen, Chun-Hao
    Hong, Tzung-Pei
    Tseng, Vincent S.
    2008 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS 1-5, 2008, : 1233 - +
  • [33] Gaussian Process Learning: A Divide-and-Conquer Approach
    Li, Wenye
    ADVANCES IN NEURAL NETWORKS - ISNN 2014, 2014, 8866 : 262 - 269
  • [34] A divide-and-conquer approach for content replication in WMNs
    Al-Arnaout, Zakwan
    Fu, Qiarig
    Frean, Marcus
    COMPUTER NETWORKS, 2013, 57 (18) : 3914 - 3928
  • [35] A Divide-and-Conquer Approach to the Summarization of Long Documents
    Gidiotis, Alexios
    Tsoumakas, Grigorios
    IEEE-ACM TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING, 2020, 28 (28) : 3029 - 3040
  • [36] A divide-and-conquer approach to compressed sensing MRI
    Sun, Liyan
    Fan, Zhiwen
    Ding, Xinghao
    Cai, Congbo
    Huang, Yue
    Paisley, John
    MAGNETIC RESONANCE IMAGING, 2019, 63 : 37 - 48
  • [37] A PARALLEL DIVIDE-AND-CONQUER ALGORITHM FOR FINDING MINIMUM ENERGY TRAJECTORIES
    Leandro, Carlos
    Ambrosio, Jorge
    PROCEEDINGS OF THE 7TH INTERNATIONAL CONFERENCE ON MECHANICS AND MATERIALS IN DESIGN (M2D2017), 2017, : 155 - 156
  • [38] Conflict graph-based model for IEEE 802.11 networks: A Divide-and-Conquer approach
    Stojanova, M.
    Begin, T.
    Busson, A.
    PERFORMANCE EVALUATION, 2019, 130 : 64 - 85
  • [39] A Divide-and-Conquer Approach Towards Understanding Deep Networks
    Fu, Weilin
    Breininger, Katharina
    Schaffert, Roman
    Ravikumar, Nishant
    Maier, Andreas
    MEDICAL IMAGE COMPUTING AND COMPUTER ASSISTED INTERVENTION - MICCAI 2019, PT I, 2019, 11764 : 183 - 191
  • [40] A divide-and-conquer approach to analyze underdetermined biochemical models
    Kotte, Oliver
    Heinemann, Matthias
    BIOINFORMATICS, 2009, 25 (04) : 519 - 525