Literature DB >> 19019848

A practical method for exact computation of subtree prune and regraft distance.

Yufeng Wu1.   

Abstract

MOTIVATION: Subtree prune and regraft (SPR) is one kind of tree rearrangements that has seen applications in solving several computational biology problems. The minimum number of rooted SPR ((r)SPR) operations needed to transform one rooted binary tree to another is called the (r)SPR distance between the two trees. Computing the (r)SPR distance has been actively studied in recent years. Currently, there is a lack of practical software tools for computing the (r)SPR distance for relatively large trees with large (r)SPR distance.
RESULTS: In this article, we present a simple and practical method that computes the exact (r)SPR distance with integer linear programming. By applying this new method on several simulated and real biological datasets, we show that our new method outperforms existing software tools in term of accuracy and efficiency. Our experimental results indicate that our method can compute the exact (r)SPR distance for many large trees with large (r)SPR distance.

Mesh:

Year:  2008        PMID: 19019848     DOI: 10.1093/bioinformatics/btn606

Source DB:  PubMed          Journal:  Bioinformatics        ISSN: 1367-4803            Impact factor:   6.937


  10 in total

1.  An algorithm for constructing parsimonious hybridization networks with multiple phylogenetic trees.

Authors:  Yufeng Wu
Journal:  J Comput Biol       Date:  2013-10       Impact factor: 1.479

2.  SPRIT: Identifying horizontal gene transfer in rooted phylogenetic trees.

Authors:  Tobias Hill; Karl J V Nordström; Mikael Thollesson; Tommy M Säfström; Andreas K E Vernersson; Robert Fredriksson; Helgi B Schiöth
Journal:  BMC Evol Biol       Date:  2010-02-13       Impact factor: 3.260

3.  Comparing Phylogenetic Trees by Matching Nodes Using the Transfer Distance Between Partitions.

Authors:  Damian Bogdanowicz; Krzysztof Giaro
Journal:  J Comput Biol       Date:  2017-02-08       Impact factor: 1.479

4.  Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees.

Authors:  Yufeng Wu
Journal:  Bioinformatics       Date:  2010-06-15       Impact factor: 6.937

5.  Linear-time algorithms for phylogenetic tree completion under Robinson-Foulds distance.

Authors:  Mukul S Bansal
Journal:  Algorithms Mol Biol       Date:  2020-04-13       Impact factor: 1.405

6.  A fast tool for minimum hybridization networks.

Authors:  Zhi-Zhong Chen; Lusheng Wang; Satoshi Yamanaka
Journal:  BMC Bioinformatics       Date:  2012-07-02       Impact factor: 3.169

Review 7.  Evaluating phylogenetic congruence in the post-genomic era.

Authors:  Jessica W Leigh; François-Joseph Lapointe; Philippe Lopez; Eric Bapteste
Journal:  Genome Biol Evol       Date:  2011-06-28       Impact factor: 3.416

8.  TreeKO: a duplication-aware algorithm for the comparison of phylogenetic trees.

Authors:  Marina Marcet-Houben; Toni Gabaldón
Journal:  Nucleic Acids Res       Date:  2011-02-18       Impact factor: 16.971

9.  Minimum variance rooting of phylogenetic trees and implications for species tree reconstruction.

Authors:  Uyen Mai; Erfan Sayyari; Siavash Mirarab
Journal:  PLoS One       Date:  2017-08-11       Impact factor: 3.240

10.  Netcombin: An algorithm for constructing optimal phylogenetic network from rooted triplets.

Authors:  Hadi Poormohammadi; Mohsen Sardari Zarchi
Journal:  PLoS One       Date:  2020-09-18       Impact factor: 3.240

  10 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.