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 条
  • [1] Distances Between Phylogenetic Trees: A Survey
    Feng Shi
    Qilong Feng
    Jianer Chen
    Lusheng Wang
    Jianxin Wang
    [J]. Tsinghua Science and Technology, 2013, 18 (05) : 490 - 499
  • [2] On distances between phylogenetic trees
    He, X
    Jiang, T
    Li, M
    Tromp, J
    [J]. PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, : 427 - 436
  • [3] 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
  • [4] Nodal distances for rooted phylogenetic trees
    Cardona, Gabriel
    Llabres, Merce
    Rossello, Francesc
    Valiente, Gabriel
    [J]. JOURNAL OF MATHEMATICAL BIOLOGY, 2010, 61 (02) : 253 - 276
  • [5] Nodal distances for rooted phylogenetic trees
    Gabriel Cardona
    Mercè Llabrés
    Francesc Rosselló
    Gabriel Valiente
    [J]. Journal of Mathematical Biology, 2010, 61 : 253 - 276
  • [6] Computing nearest neighbour interchange distances between ranked phylogenetic trees
    Collienne, Lena
    Gavryushkin, Alex
    [J]. JOURNAL OF MATHEMATICAL BIOLOGY, 2021, 82 (1-2)
  • [7] Computing nearest neighbour interchange distances between ranked phylogenetic trees
    Lena Collienne
    Alex Gavryushkin
    [J]. Journal of Mathematical Biology, 2021, 82
  • [8] DISTANCES BETWEEN TREES
    MARGUSH, T
    [J]. DISCRETE APPLIED MATHEMATICS, 1982, 4 (04) : 281 - 290
  • [9] Analysis on Algorithms for Constructing Phylogenetic Trees From Distances
    Wang, Juan
    [J]. IEEE ACCESS, 2019, 7 : 129430 - 129436
  • [10] Probabilistic Distances Between Trees
    Garba, Maryam K.
    Nye, Tom M. W.
    Boys, Richard J.
    [J]. SYSTEMATIC BIOLOGY, 2018, 67 (02) : 320 - 327