-
Dear Fitzpatrick Lab,
I noticed that the geographic distance between two lat-lon points is calculated using the Pythagorean theorem (e.g. `v
-
Hello,
I am wondering if there is a way to draw scaled trees and simultaneously reduce the size of the labels. Any guidance on this would be greatly appreciated.
```
import tanglegram a…
-
### Please make sure these conditions are met
- [X] I have checked that this issue has not already been reported.
- [X] I have confirmed this bug exists on the latest version of scanpy.
- [X] (op…
-
# C-MARINeR
Jenny Rieck & Derek Beaton
## Project Description
C-MARINeR is a focused sub-project MARINeR: Multivariate Analysis and Resampling Inference for Neuroimaging in R. The "C" stands ge…
-
To really enable door-to-door accessibility estimates one may want to
The current algorithm implementations in gtfspy allow for door-to-door routing (via adding artificial stops), but the implemen…
-
```
julia> g = SimpleWeightedGraph(2); add_edge!(g, 1, 2); collect(edges(g))
1-element Array{SimpleWeightedEdge{Int64,Float64},1}:
Edge 1 => 2 with weight 1.0
julia> rem_edge!(g, 1, 2); collect…
-
Since I realized that you must specify binary = T in vegdist to compute distance matrices on presence/absence data as opposed to abundance data, I keep seeing more and more places where others are inc…
-
Hello, I have been researching monocular depth estimation recently. I found this place, and the documentation is very detailed, but I still have a small question that I would like the author to help m…
-
Hi @pierreablin,
Updating the code of [RotoGrad](https://github.com/adrianjav/rotograd), I started using your library, and during testing I've found that the rotation matrices occasionally end up w…
-
Is it possible to use HDBSCAN with the Levenshtein distance? My dataset is too large to make a full distance matrix to feed into it.
The Levenshtein distance satisfies the triangle inequality whic…