v1.5.2

• Include simple parallel implementation of brute force nearest neighbors search using scipy's cdist and multiprocessing. This may be more efficient than kdtree on very large high-dimensional data sets
  and avoids memory issues that arise in sklearn's implementation.
• Refactor parallel_jaccard_kernel to remove unnecessary use of ctypes and multiprocessing.Array.