Benjamin Chu

I am experiencing the same issue on Julia 1.7.3, VS code 1.67.2, and Julia language support 1.6.17.

More specifically, I am only interested in the pairs `(i, j)` such that this distance is minimized for every column of `x`. If we compute the distance for all such...

Thank you so much for the lighting response time! I benchmarked a few (large) bitmatrix times dense Float64 vectors: ```Julia function gemv_naive!(c, A, b) @inbounds for j in 1:size(A, 2)...

You are amazing! You have given me enough to work with. I will try to tackle the remainder terms. Thank you for the awesome package and your lighting response times.

There might be a related problem with `ismissing`: ``` julia> function sum_skipmissing_avx(x) s = zero(eltype(x)) @avx for i in eachindex(x) if !ismissing(x[i]) s += x[i] end end return s end...

Ok, thanks for the response. I'm leaving this issue open for now since it doesn't seem like there is a simple solution, but feel free to close it.

I contacted cluster admins and this is his response: > SGE's "qsub" command normally is followed by a file name (i.e. job script), to be submitted by the "qsub" command,...

I would be interested if this package can support time-varying HMMs. May I ask if there have been any progress on this PR?

Thank you for the response. For the moment, I have successfully installed Minimac3 (on a linux michine) and it gets the job done. I'm inclined on closing the issue, or...

I think I have a rough idea how to do this. Basically, at each merge step, I will only consider merge 2 clusters if they are adjacent and has the...