Analysis on Algorithms for Constructing Phylogenetic Trees From Distances

被引:3
|
作者
Wang, Juan [1 ]
机构
[1] Inner Mongolia Univ, Sch Comp Sci, Hohhot 010021, Peoples R China
基金
中国国家自然科学基金;
关键词
Phylogenetic trees; neighbour-joining; NJ; distances; NEIGHBOR-JOINING METHOD; SAITOU;
D O I
10.1109/ACCESS.2019.2939952
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Neighbour-joining algorithm (NJ for short) is an used widely algorithm for constructing phylogenetic trees from distances because of its high accuracy. For NJ costs a lot of time to construct phylogenetic trees for the large input data, it does not often output a result within feasible time. Until now, there are several improved algorithms of NJ aiming for speeding up the construction of trees, but there is no research on the accuracy of those improved algorithms. The paper will analyze and compare the accuracy of NJ as well as its improved algorithms by means of the experiments. We introduce a new improved algorithm, called RandomNJ, which is an efficient method for constructing phylogenetic trees from distances. Furthermore, we design the INJ which is a web-based server for on-line constructing the phylogenetic trees using the improved algorithms and NJ. It is available from http://bioinformatics.imu.edu.cn/INJ/.
引用
收藏
页码:129430 / 129436
页数:7
相关论文
共 50 条
  • [21] DERIVING PHYLOGENETIC TREES FROM ALLELE FREQUENCIES - A COMPARISON OF 9 GENETIC DISTANCES
    ROGERS, JS
    [J]. SYSTEMATIC ZOOLOGY, 1986, 35 (03): : 297 - 310
  • [22] On the Distribution of the Distances Between Pairs of Leaves in Phylogenetic Trees
    Mir, Arnau
    Rossello, Francesc
    [J]. BIOTECHNO 2011: THE THIRD INTERNATIONAL CONFERENCE ON BIOINFORMATICS, BIOCOMPUTATIONAL SYSTEMS AND BIOTECHNOLOGIES, 2011, : 100 - 103
  • [23] Algorithms for computing the distances between unordered trees
    Liu, SM
    Tanaka, E
    [J]. ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 1996, 79 (10): : 88 - 102
  • [24] A construction of phylogenetic trees by genetic algorithms
    Vieira, RV
    [J]. METMBS'00: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON MATHEMATICS AND ENGINEERING TECHNIQUES IN MEDICINE AND BIOLOGICAL SCIENCES, VOLS I AND II, 2000, : 451 - 457
  • [25] Markov chain Monte Carlo algorithms for the Bayesian analysis of phylogenetic trees
    Larget, B
    Simon, DL
    [J]. MOLECULAR BIOLOGY AND EVOLUTION, 1999, 16 (06) : 750 - 759
  • [26] Nine easy steps for constructing reliable trees from published phylogenetic analyses
    Zander, Richotrd H.
    [J]. ANNALS OF THE MISSOURI BOTANICAL GARDEN, 2007, 94 (03) : 690 - 708
  • [27] CONSTRUCTING PHYLOGENETIC TREES EFFICIENTLY USING COMPATIBILITY CRITERIA
    WARNOW, TJ
    [J]. NEW ZEALAND JOURNAL OF BOTANY, 1993, 31 (03) : 239 - 247
  • [28] MACT - APPLE MACINTOSH PROGRAMS FOR CONSTRUCTING PHYLOGENETIC TREES
    LUTTKE, A
    FUCHS, R
    [J]. COMPUTER APPLICATIONS IN THE BIOSCIENCES, 1992, 8 (06): : 591 - 594
  • [29] PartFastTree: Constructing Large Phylogenetic Trees and Estimating Their Reliability
    Li, Jianhui
    Meng, Zhen
    Hou, Yanfei
    Zhou, Yuanchun
    Gao, Yanping
    [J]. 2013 NINTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2013, : 1052 - 1056
  • [30] Evolutionary Algorithms for Constructing an Ensemble of Decision Trees
    Dolotov, Evgeny
    Zolotykh, Nikolai
    [J]. ANALYSIS OF IMAGES, SOCIAL NETWORKS AND TEXTS (AIST 2019), 2020, 1086 : 9 - 15