Maximum Parsimony, Substitution Model, and Probability Phylogenetic Trees

被引:3
|
作者
Weng, J. F. [1 ]
Thomas, D. A. [1 ]
Mareels, I. [2 ]
机构
[1] Univ Melbourne, Dept Mech Engn, Melbourne, Vic 3031, Australia
[2] Univ Melbourne, Melbourne Sch Engn, Melbourne, Vic 3031, Australia
关键词
probability representation; substitution model; steiner tree; EVOLUTION;
D O I
10.1089/cmb.2009.0232
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
The problem of inferring phylogenies (phylogenetic trees) is one of the main problems in computational biology. There are three main methods for inferring phylogenies-Maximum Parsimony (MP), Distance Matrix (DM) and Maximum Likelihood (ML), of which the MP method is the most well-studied and popular method. In the MP method the optimization criterion is the number of substitutions of the nucleotides computed by the differences in the investigated nucleotide sequences. However, the MP method is often criticized as it only counts the substitutions observable at the current time and all the unobservable substitutions that really occur in the evolutionary history are omitted. In order to take into account the unobservable substitutions, some substitution models have been established and they are now widely used in the DM and ML methods but these substitution models cannot be used within the classical MP method. Recently the authors proposed a probability representation model for phylogenetic trees and the reconstructed trees in this model are called probability phylogenetic trees. One of the advantages of the probability representation model is that it can include a substitution model to infer phylogenetic trees based on the MP principle. In this paper we explain how to use a substitution model in the reconstruction of probability phylogenetic trees and show the advantage of this approach with examples.
引用
收藏
页码:67 / 80
页数:14
相关论文
共 50 条
  • [21] A Memetic Algorithm for Phylogenetic Reconstruction with Maximum Parsimony
    Richer, Jean-Michel
    Goeffon, Adrien
    Hao, Jin-Kao
    [J]. EVOLUTIONARY COMPUTATION, MACHINE LEARNING AND DATA MINING IN BIOINFORMATICS, PROCEEDINGS, 2009, 5483 : 164 - +
  • [22] On the quirks of maximum parsimony and likelihood on phylogenetic networks
    Bryant, Christopher
    Fischer, Mareike
    Linz, Simone
    Semple, Charles
    [J]. JOURNAL OF THEORETICAL BIOLOGY, 2017, 417 : 100 - 108
  • [23] Reconstructing phylogenetic networks using maximum parsimony
    Nakhleh, L
    Jin, GH
    Zhao, FM
    Mellor-Crummey, J
    [J]. 2005 IEEE COMPUTATIONAL SYSTEMS BIOINFORMATICS CONFERENCE, PROCEEDINGS, 2005, : 93 - 102
  • [24] Non-hereditary Maximum Parsimony trees
    Fischer, Mareike
    [J]. JOURNAL OF MATHEMATICAL BIOLOGY, 2012, 65 (02) : 293 - 308
  • [25] Non-hereditary Maximum Parsimony trees
    Mareike Fischer
    [J]. Journal of Mathematical Biology, 2012, 65 : 293 - 308
  • [26] LVB: parsimony and simulated annealing in the search for phylogenetic trees
    Barker, D
    [J]. BIOINFORMATICS, 2004, 20 (02) : 274 - 275
  • [27] Maximum Parsimony Phylogenetic Inference Using Simulated Annealing
    Richer, Jean-Michel
    Rodriguez-Tello, Eduardo
    Vazquez-Ortiz, Karla E.
    [J]. EVOLVE - A BRIDGE BETWEEN PROBABILITY, SET ORIENTED NUMERICS, AND EVOLUTIONARY COMPUTATION II, 2013, 175 : 189 - +
  • [28] Searching for phylogenetic trees under the frequency parsimony criterion: An approximation using generalized parsimony
    Berlocher, SH
    Swofford, DL
    [J]. SYSTEMATIC BIOLOGY, 1997, 46 (01) : 211 - 215
  • [29] Maximum parsimony phylogenetic inference using simulated annealing
    [J]. Richer, J.-M. (jean-michel.richer@univ-angers.fr), 1600, Springer Verlag (175 ADVANCES):
  • [30] BOGEN: A faster parsimony program for computing larger phylogenetic trees
    Minaka, N
    Suemura, T
    Asano, T
    Yamamoto, H
    Machii, K
    [J]. CLADISTICS-THE INTERNATIONAL JOURNAL OF THE WILLI HENNIG SOCIETY, 2004, 20 (01): : 89 - 89