MASTtreedist: Visualization of Tree Space Based on Maximum Agreement Subtree

被引:4
|
作者
Huang, Hong [1 ]
Li, Yongji [2 ]
机构
[1] Univ S Florida, Sch Informat, Tampa, FL 33620 USA
[2] Sun Yetsen Univ, Dept Comp Sci, Guangzhou, Guangdong, Peoples R China
关键词
cancer genomics; computational molecular biology; phylogenetic analyses;
D O I
10.1089/cmb.2012.0243
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Phylogenetic tree construction process might produce many candidate trees as the "best estimates.'' As the number of constructed phylogenetic trees grows, the need to efficiently compare their topological or physical structures arises. One of the tree comparison's software tools, the Mesquite's Tree Set Viz module, allows the rapid and efficient visualization of the tree comparison distances using multidimensional scaling (MDS). Tree-distance measures, such as Robinson-Foulds (RF), for the topological distance among different trees have been implemented in Tree Set Viz. New and sophisticated measures such as Maximum Agreement Subtree (MAST) can be continuously built upon Tree Set Viz. MAST can detect the common substructures among trees and provide more precise information on the similarity of the trees, but it is NP-hard and difficult to implement. In this article, we present a practical tree-distance metric: MASTtreedist, a MAST-based comparison metric in Mesquite's Tree Set Viz module. In this metric, the efficient optimizations for the maximum weight clique problem are applied. The results suggest that the proposed method can efficiently compute the MAST distances among trees, and such tree topological differences can be translated as a scatter of points in two-dimensional (2D) space. We also provide statistical evaluation of provided measures with respect to RF-using experimental data sets. This new comparison module provides a new tree-tree pairwise comparison metric based on the differences of the number of MAST leaves among constructed phylogenetic trees. Such a new phylogenetic tree comparison metric improves the visualization of taxa differences by discriminating small divergences of subtree structures for phylogenetic tree reconstruction.
引用
收藏
页码:42 / 49
页数:8
相关论文
共 50 条
  • [31] A space-optimized tree visualization
    Nguyen, QV
    Huang, ML
    INFOVIS 2002: IEEE SYMPOSIUM ON INFORMATION VISUALIZATION 2002, 2002, : 85 - 92
  • [32] An O(n log n)-time algorithm for the maximum constrained agreement subtree problem for binary trees
    Peng, ZS
    Ting, HF
    ALGORITHMS AND COMPUTATION, 2004, 3341 : 754 - 765
  • [33] An O(n log n)-time algorithm for the maximum constrained agreement subtree problem for binary trees
    Peng, Z. S.
    Ting, H. F.
    INFORMATION PROCESSING LETTERS, 2006, 100 (04) : 137 - 144
  • [34] A theory of subtree matching and tree kernels based on the edit distance concept
    Shin, Kilho
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2015, 75 (3-4) : 419 - 460
  • [35] A theory of subtree matching and tree kernels based on the edit distance concept
    Kilho Shin
    Annals of Mathematics and Artificial Intelligence, 2015, 75 : 419 - 460
  • [36] A Chinese-Naxi Tree-to-Tree Machine Translation Method Based on Subtree Alignment
    Gao, Shengxiang
    Yu, Zhengtao
    Liu, Chao
    Chen, Lin
    Hong, Xudong
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2015, 2015
  • [37] An Analysis of the Distribution of Swapped Subtree Sizes in Tree-based Genetic Programming
    Xie, Huayang
    Zhang, Mengjie
    Andreae, Peter
    2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 2859 - 2866
  • [38] GoTreeScape: Navigate and Explore the Tree Visualization Design Space
    Li, Guozheng
    Yuan, Xiaoru
    IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2023, 29 (12) : 5451 - 5467
  • [39] Plum Tree Visualization based on SpeedTree
    Bai, Zhi-yong
    Huang, Xin-yuan
    ADVANCED MATERIALS AND COMPUTER SCIENCE, PTS 1-3, 2011, 474-476 : 511 - 516
  • [40] Tree-based multicast key agreement
    Schwenk, J
    Martin, T
    Schaffelhofer, R
    COMMUNICATIONS AND MULTIMEDIA SECURITY ISSUES OF THE NEW CENTURY, 2001, 64 : 283 - 295