Skip to content

Commit

Permalink
Browse files Browse the repository at this point in the history
  • Loading branch information
FrankWhoee committed Aug 22, 2019
2 parents 35a6f59 + b1c0c8e commit 20ad737
Showing 1 changed file with 2 additions and 2 deletions.
4 changes: 2 additions & 2 deletions README.md
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
# RFDistribution
These codes implement an improved version of the RF distribution computation by Bryant et al.
Here, we modified the dynamic programming algorithm introduced by Bryant et al for computing the distribution of RF distance for a given tree by leveraging the Number-Theoretic Transform (NTT), and improve the running time from O(l^5) to O(l^3log(l)), where l is the number of tips of the tree.
Here, we modified the dynamic programming algorithm introduced by Bryant et al for computing the distribution of RF distance for a given tree by leveraging the Number-Theoretic Transform (NTT), and improve the running time from O(l<sup>5</sup>) to O(l<sup>3log(l)</sup>), where l is the number of tips of the tree.
Given an unrooted phylogenetic tree with l tips (T), the procedure for computing the RF distribution of this tree is as follow:
Denote the node adjacent to tip l in T by v_0. Remove tip l, and root the resulting tree with v_0 as the root. We use this rooted tree as the input to the dynamic programming algorithm.
Denote the node adjacent to tip l in T by v<sub>0</sub>. Remove tip l, and root the resulting tree with v<sub>0</sub> as the root. We use this rooted tree as the input to the dynamic programming algorithm.


# Installation
Expand Down

0 comments on commit 20ad737

Please sign in to comment.