Distances Between Phylogenetic Trees: A Survey

被引:4
|
作者
Shi, Feng [1 ]
Feng, Qilong [1 ]
Chen, Jianer [1 ,2 ]
Wang, Lusheng [3 ]
Wang, Jianxin [1 ]
机构
[1] Cent South Univ, Sch Informat Sci & Engn, Changsha 410083, Peoples R China
[2] Texas A&M Univ, Dept Comp Sci & Engn, College Stn, TX 77843 USA
[3] City Univ Hong Kong, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China
基金
中国国家自然科学基金;
关键词
phylogenetic tree; tree bisection and reconnection; subtree prune and regraft; fixed-parameter algorithm; approximation algorithm; SEQUENCES SUBJECT; COMPLEXITY; COMPUTATION; SIMILARITY; ALGORITHM; EVOLUTION;
D O I
10.1109/TST.2013.6616522
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Phylogenetic trees have been widely used in the study of evolutionary biology for representing the tree-like evolution of a collection of species. However, different data sets and different methods often lead to the construction of different phylogenetic trees for the same set of species. Therefore, comparing these trees to determine similarities or, equivalently, dissimilarities, becomes the fundamental issue. Typically, Tree Bisection and Reconnection (TBR) and Subtree Prune and Regraft (SPR) distances have been proposed to facilitate the comparison between different phylogenetic trees. In this paper, we give a survey on the aspects of computational complexity, fixed-parameter algorithms, and approximation algorithms for computing the TBR and SPR distances of phylogenetic trees.
引用
收藏
页码:490 / 499
页数:10
相关论文
共 50 条
  • [41] Average distances on substitution trees
    Xi, Lifeng
    Ye, Qianqian
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2019, 529
  • [42] On the Complexity of Computing MP Distance Between Binary Phylogenetic Trees
    Steven Kelk
    Mareike Fischer
    [J]. Annals of Combinatorics, 2017, 21 : 573 - 604
  • [43] On the distribution of distances in recursive trees
    Dobrow, RP
    [J]. JOURNAL OF APPLIED PROBABILITY, 1996, 33 (03) : 749 - 757
  • [44] On Local Representation of Distances in Trees
    Gavoille, Cyril
    Labourel, Arnaud
    [J]. PODC'07: PROCEEDINGS OF THE 26TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2007, : 352 - 353
  • [45] On the Complexity of Computing MP Distance Between Binary Phylogenetic Trees
    Kelk, Steven
    Fischer, Mareike
    [J]. ANNALS OF COMBINATORICS, 2017, 21 (04) : 573 - 604
  • [46] Sum of weighted distances in trees
    Cai, Qingqiong
    Li, Tao
    Shi, Yongtang
    Wang, Hua
    [J]. DISCRETE APPLIED MATHEMATICS, 2019, 257 : 67 - 84
  • [47] Aggregated Dendrograms for Visual Comparison between Many Phylogenetic Trees
    Liu, Zipeng
    Zhan, Shing Hei
    Munzner, Tamara
    [J]. IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2020, 26 (09) : 2732 - 2747
  • [48] A fully resolved consensus between fully resolved phylogenetic trees
    Amgarten Quitzau, Jose Augusto
    Meidanis, Joao
    [J]. GENETICS AND MOLECULAR RESEARCH, 2006, 5 (01) : 269 - 283
  • [49] CTree:: comparison of clusters between phylogenetic trees made easy
    Archer, John
    Robertson, David L.
    [J]. BIOINFORMATICS, 2007, 23 (21) : 2952 - 2953
  • [50] Evolutionary network genomics of wood formation in a phylogenetic survey of angiosperm forest trees
    Zinkgraf, Matthew
    Zhao, Shu-Tang
    Canning, Courtney
    Gerttula, Suzanne
    Lu, Meng-Zhu
    Filkov, Vladimir
    Groover, Andrew
    [J]. NEW PHYTOLOGIST, 2020, 228 (06) : 1811 - 1823