  We describe an algorithm that, given a k-tuple of permutations representing
the monodromy of a rational map, constructs an arbitrarily precise
floating-point complex approximation of that map.
  We then explain how it has been used to study a problem in dynamical systems
raised by Cui.
