SPRIT: Identifying horizontal gene transfer in rooted phylogenetic trees

被引:18
|
作者
Hill, Tobias [1 ]
Nordstrom, Karl J. V. [1 ]
Thollesson, Mikael [2 ]
Safstrom, Tommy M. [1 ]
Vernersson, Andreas K. E. [1 ]
Fredriksson, Robert [1 ]
Schioth, Helgi B. [1 ]
机构
[1] Uppsala Univ, Biomed Ctr, Dept Neurosci, SE-75124 Uppsala, Sweden
[2] Uppsala Univ, Dept Evolut Genom & Systemat, SE-75236 Uppsala, Sweden
来源
BMC EVOLUTIONARY BIOLOGY | 2010年 / 10卷
基金
瑞典研究理事会;
关键词
EVOLUTION; NUMBER; EVENTS;
D O I
10.1186/1471-2148-10-42
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
Background: Phylogenetic trees based on sequences from a set of taxa can be incongruent due to horizontal gene transfer (HGT). By identifying the HGT events, we can reconcile the gene trees and derive a taxon tree that adequately represents the species' evolutionary history. One HGT can be represented by a rooted Subtree Prune and Regraft (RSPR) operation and the number of RSPRs separating two trees corresponds to the minimum number of HGT events. Identifying the minimum number of RSPRs separating two trees is NP-hard, but the problem can be reduced to fixed parameter tractable. A number of heuristic and two exact approaches to identifying the minimum number of RSPRs have been proposed. This is the first implementation delivering an exact solution as well as the intermediate trees connecting the input trees. Results: We present the SPR Identification Tool (SPRIT), a novel algorithm that solves the fixed parameter tractable minimum RSPR problem and its GPL licensed Java implementation. The algorithm can be used in two ways, exhaustive search that guarantees the minimum RSPR distance and a heuristic approach that guarantees finding a solution, but not necessarily the minimum one. We benchmarked SPRIT against other software in two different settings, small to medium sized trees i.e. five to one hundred taxa and large trees i.e. thousands of taxa. In the small to medium tree size setting with random artificial incongruence, SPRIT's heuristic mode outperforms the other software by always delivering a solution with a low overestimation of the RSPR distance. In the large tree setting SPRIT compares well to the alternatives when benchmarked on finding a minimum solution within a reasonable time. SPRIT presents both the minimum RSPR distance and the intermediate trees. Conclusions: When used in exhaustive search mode, SPRIT identifies the minimum number of RSPRs needed to reconcile two incongruent rooted trees. SPRIT also performs quick approximations of the minimum RSPR distance, which are comparable to, and often better than, purely heuristic solutions. Put together, SPRIT is an excellent tool for identification of HGT events and pinpointing which taxa have been involved in HGT.
引用
收藏
页数:9
相关论文
共 50 条
  • [1] SPRIT: Identifying horizontal gene transfer in rooted phylogenetic trees
    Tobias Hill
    Karl JV Nordström
    Mikael Thollesson
    Tommy M Säfström
    Andreas KE Vernersson
    Robert Fredriksson
    Helgi B Schiöth
    BMC Evolutionary Biology, 10
  • [2] Identification of horizontal gene transfer from phylogenetic gene trees
    V'yugin, VV
    Gelfand, MS
    Lyubetsky, VA
    MOLECULAR BIOLOGY, 2003, 37 (04) : 571 - 584
  • [3] Identification of Horizontal Gene Transfer from Phylogenetic Gene Trees
    V. V. V'yugin
    M. S. Gelfand
    V. A. Lyubetsky
    Molecular Biology, 2003, 37 : 571 - 584
  • [4] Phylogenetic validation of horizontal gene transfer?
    Mark van Passel
    Aldert Bart
    Yvonne Pannekoek
    Arie van der Ende
    Nature Genetics, 2004, 36 : 1028 - 1028
  • [5] Phylogenetic validation of horizontal gene transfer?
    van Passel, M
    Bart, A
    Pannekoek, Y
    van der Ende, A
    NATURE GENETICS, 2004, 36 (10) : 1028 - 1028
  • [6] BIMLR: A method for constructing rooted phylogenetic networks from rooted phylogenetic trees
    Wang, Juan
    Guo, Maozu
    Xing, Linlin
    Che, Kai
    Liu, Xiaoyan
    Wang, Chunyu
    GENE, 2013, 527 (01) : 344 - 351
  • [7] On the Combinatorics of Rooted Binary Phylogenetic Trees
    Yun S. Song
    Annals of Combinatorics, 2003, 7 (3) : 365 - 379
  • [8] Nodal distances for rooted phylogenetic trees
    Gabriel Cardona
    Mercè Llabrés
    Francesc Rosselló
    Gabriel Valiente
    Journal of Mathematical Biology, 2010, 61 : 253 - 276
  • [9] A Metric on the Space of Rooted Phylogenetic Trees
    Wang, Juan
    Guo, Maozu
    CURRENT BIOINFORMATICS, 2018, 13 (05) : 487 - 491
  • [10] Tanglegrams for rooted phylogenetic trees and networks
    Scornavacca, Celine
    Zickmann, Franziska
    Huson, Daniel H.
    BIOINFORMATICS, 2011, 27 (13) : I248 - I256