Tree searches under Sankoff parsimony

被引：0
|
作者：
Goloboff, PA [1 ]
机构：
[1] Consejo Nacl Invest Cient & Tecn, Inst Miguel Lillo, RA-4000 San Miguel De Tucuman, Tucuman, Argentina
来源：
CLADISTICS | 1998年 / 14卷 / 03期
关键词：
D O I：
暂无
中图分类号：
Q [生物科学];
学科分类号：
07 ; 0710 ; 09 ;
摘要：
Algorithms to speed up tree searches under Sankoff parsimony are described. For T terminal taxa, an exact algorithm allows calculating length during searches T to 2T times faster than a complete down-pass optimization. An approximate but accurate method is from 3T to 8T times faster than a down-pass. Other algorithms that provide additional increases of speed for simple symmetrical transformation costs are described. (C) 1998 The Willi Hennig Society.
引用
收藏
页码：229 / 237
页数：9
相关论文
共 50 条
  • [21] Searching for phylogenetic trees under the frequency parsimony criterion: An approximation using generalized parsimony
    Berlocher, SH
    Swofford, DL
    SYSTEMATIC BIOLOGY, 1997, 46 (01) : 211 - 215
  • [22] AN ATTEMPT AT RECONSTRUCTING A PHYLOGENETIC TREE OF THE CILIOPHORA USING PARSIMONY METHODS
    DEPUYTORAC, P
    GRAIN, J
    LEGENDRE, P
    EUROPEAN JOURNAL OF PROTISTOLOGY, 1994, 30 (01) : 1 - 17
  • [23] Impact of gene family evolutionary histories on phylogenetic species tree inference by gene tree parsimony
    Shi, Tao
    MOLECULAR PHYLOGENETICS AND EVOLUTION, 2016, 96 : 9 - 16
  • [24] A unifying model of genome evolution under parsimony
    Benedict Paten
    Daniel R Zerbino
    Glenn Hickey
    David Haussler
    BMC Bioinformatics, 15
  • [25] A unifying model of genome evolution under parsimony
    Paten, Benedict
    Zerbino, Daniel R.
    Hickey, Glenn
    Haussler, David
    BMC BIOINFORMATICS, 2014, 15
  • [26] Self-weighted optimization: Tree searches and character state reconstructions under implied transformation costs
    Goloboff, PA
    CLADISTICS, 1997, 13 (03) : 225 - 245
  • [27] Measuring Branch Support in Species Trees Obtained by Gene Tree Parsimony
    Joly, Simon
    Bruneau, Anne
    SYSTEMATIC BIOLOGY, 2009, 58 (01) : 100 - 113
  • [28] MPBoot: fast phylogenetic maximum parsimony tree inference and bootstrap approximation
    Diep Thi Hoang
    Le Sy Vinh
    Tomáš Flouri
    Alexandros Stamatakis
    Arndt von Haeseler
    Bui Quang Minh
    BMC Evolutionary Biology, 18
  • [29] FPGA Hardware Acceleration of a Phylogenetic Tree Reconstruction with Maximum Parsimony Algorithm
    Block, Henry
    Maruyama, Tsutomu
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2017, E100D (02): : 256 - 264
  • [30] Algorithms for Genome-Scale Phylogenetics Using Gene Tree Parsimony
    Bansal, Mukul S.
    Eulenstein, Oliver
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2013, 10 (04) : 939 - 956
12345