KomPhy
Overview
{S0, S2, S3}
{S1, S4}
Trivial Case
S1
S4
{S0, S2}
Trivial Case
S0
S2
S3
{S0, S1, S2, S3, S4}
The function call tree is the
phylogenetic tree
S0 = (acg...), S1 = (tac...), S2 = (cgc...), S3 = (ggt...), S4 = (act...)
Base case:
|S| < 3, only one possible
arrangement
Recursive Step:
|S| > 2, create new network
and partition S