sentences:  It involves searching the
  discrete space of unrooted binary tree topologies whose size is exponential in
  the number of leaves.For n leaves there are
  1 • 3 • 5 • ... • (2n-3)
  different topologies.Enumerating them is not feasible already for a small
  number of leaves.