Select Code to Download

Triplets :: S=('b,c|a', 'a,c|d', 'd,e|b'),
Species :: L={a,b,c,d,e}
...
   - Let T(i) = TreeConstruct(S(i))
   - Let T be a tree formed by connecting all T(i) with the same paren
+t node. Return T.
4.]If q=1 & C1 contains exactly one leaf,return the leaf ,else return 
+fail.

use strict;  
use warnings;   
use Graph;  
...
- d:
    - e