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 条
  • [41] EIGENVALUES OF A SYMMETRICAL TRIDIAGONAL MATRIX - A DIVIDE-AND-CONQUER APPROACH
    KRISHNAKUMAR, AS
    MORF, M
    NUMERISCHE MATHEMATIK, 1986, 48 (03) : 349 - 368
  • [42] JuliusC: A practical approach for the analysis of divide-and-conquer algorithms
    D'Alberto, P
    Nicolau, A
    LANGUAGES AND COMPILERS FOR HIGH PERFORMANCE COMPUTING, 2005, 3602 : 117 - 131
  • [43] SAR processing in small pieces - a divide-and-conquer approach
    Larsen, Yngvar
    Engen, Geir
    10TH EUROPEAN CONFERENCE ON SYNTHETIC APERTURE RADAR (EUSAR 2014), 2014,
  • [44] A Divide-and-Conquer Approach for Solving Interval Algebra Networks
    Li, Jason Jingshi
    Huang, Jinbo
    Renz, Jochen
    21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, 2009, : 572 - 577
  • [45] A divide-and-conquer approach to geometric sampling for active learning
    Cao, Xiaofeng
    EXPERT SYSTEMS WITH APPLICATIONS, 2020, 140 (140)
  • [46] A divide-and-conquer approach for analysing overlaid data structures
    Lee, Oukseh
    Yang, Hongseok
    Petersen, Rasmus
    FORMAL METHODS IN SYSTEM DESIGN, 2012, 41 (01) : 4 - 24
  • [47] Failure of divide-and-conquer approach in the characterization of unsaturated soils
    Zhang, X.
    UNSATURATED SOIL MECHANICS-FROM THEORY TO PRACTICE, 2016, : 561 - 568
  • [48] Divide-and-conquer algorithms on the hypercube
    Mayr, EW
    Werchner, R
    THEORETICAL COMPUTER SCIENCE, 1996, 162 (02) : 283 - 296
  • [49] An intelligent divide-and-conquer approach for driving style management
    Al Abri K.A.
    Jabeur N.
    Gharrad H.
    Yasar A.U.-H.
    Personal and Ubiquitous Computing, 2023, 27 (05) : 1729 - 1746
  • [50] Divide-and-Conquer Computational Approach to Principal Component Analysis
    Kadappa, Vijayakumar
    Negi, Atul
    PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON FRONTIERS OF INTELLIGENT COMPUTING: THEORY AND APPLICATIONS (FICTA) 2014, VOL 1, 2015, 327 : 641 - 649