| Calling Sequence | RobinsonFoulds(trees)
| |||||||||
| Parameters |
| |||||||||
| Return Type | matrix(numeric) | |||||||||
| Synopsis | The Robinson and Foulds (RF) distance between two trees is the number of non-trivial bipartitions present in one of the two trees but not the other, divided by the number of possible bi-partitions. Thus, the smaller the RF distance between two trees the closer are their topologies. The algorithm runs in O(m^2*n), where m ist the number of trees an n the number of Leaves. | |||||||||
| References | Pattengale, Gottlieb and Morret, "Efficiently Computing the Robinson-Foulds Metric", J. Comp. Biol., 2007, 14 (6), 724--735 | |||||||||
| Examples | > t1 := Tree(Tree(Leaf(a,2),1,Leaf(b,2)),0,Tree(Leaf(c,2),1,Leaf(d,2))): > t2 := Tree(Tree(Leaf(a,2),1,Leaf(d,2)),0,Tree(Leaf(c,2),1,Leaf(b,2))): > RobinsonFoulds([t1,t2]); [[0, 1], [1, 0]] | |||||||||
| See also | IdenticalTrees, Tree | |||||||||