This release is primarily concerned with extending the functionality of CAJAL with an eye towards analysis of larger datasets and larger objects.
* Rewrote the gradient descent algorithm for computing Gromov-Wasserstein in Cython and made small changes to the algorithm to improve performance, perhaps a 20% speed improvement.
* Implemented a lower bound for Gromov-Wasserstein from Memoli's original paper, called SLB. We can use this to filter out cell pairs which are sufficiently far apart that they cannot be within each other's nearest neighbor list. This technique is general and does not require a notion of major/minor axis, it is compatible with geodesic distance. It is multiple orders of magnitude faster than GW. This reduces the number of cell pairs to compute by about 70%, if the GW distance only needs to be known precisely for the nearest neighbors.
* Implemented an approximation to GW, called [quantized GW](https://link.springer.com/chapter/10.1007/978-3-030-86523-8_49#citeas), which involves replacing the cell by a subset of its points and using this as an approximation to the original space. The approximation is acceptable and offers a substantial reduction in computation time; approximating a 100pt space by a 30pt space gives an 87% reduction in computation time.
* Implemented a combined analysis tool which uses SLB to filter the cell pairs down to a short list of potential nearest neighbors and then applies quantized GW to the remaining pairs. This combined tool should make it practical to scale to very large datasets such as the MICrONs dataset.
* CAJAL is now compatible with Python 3.9, 3.10, 3.11.
* Improved error handling
* Fixed a performance issue in underlying linear algebra library where overzealous multithreading slowed performance.
For illustrations and usage tutorials, please see our documentation at cajal.readthedocs.io.