-
Hi,
I am trying to implement a out-of-memory storage for distances matrices where I need to store the lower diagonal entries only. `lvec` seems like a natural fit over `bigmemory` family of package…
-
Computing pairwise distances (as a matrix, or otherwise) for more than (say) 500K points is not meaningful, as the difficulty to allocate and access this much space overweights the speedup you might …
-
Dear author,
Thank you for your excellent work. I have a quick question about the construction of the adjacency and distance matrices, which I found a little unclear in the paper. Could you please co…
-
Our current implementation computed subject-wise correlation matrices, fisher's r2zs them, computes the euclidean mean and then inverts the fisher's r2z (i.e. z2r)
We could explore other distance f…
-
I attempted to calculate the Euclidean distance matrix between the regional centers of mass using the provided sc and fc matrices. However, the result does not match the Euclidean distance matrix prov…
-
Might be a faster alternative to fasttree (looks like it requires aligned sequences)
http://www.biomedcentral.com/1471-2105/14/334
Fastphylo: Fast tools for phylogenetics
"We present fastphylo, a s…
-
Sometimes we do not have point representations in space but rather only distances between those points.
Therefore it would be great if some algorithms (I'm especially interested in HDBSCAN and Agglo…
-
### Describe the workflow you want to enable
I would like to calculate the upper triangle of a distance from `scipy.spatial.distance.pdist` instead of the redundant and memory intensive version fro…
-
Current strategy:
Using random samples for the hulls.
Closest n matrices :
For each class we calculate the closest n (n=10) matrices to the test sample. This will be done using distance_logeuclid…
-
Hi
I have an issue with the output using this input data. My problem is that I'm passing this data to the algorithm, but unfortunately, despite having 3 vehicles, all the jobs are being assigned to v…