Thomas Mailund
Thomas Mailund
Can you tell me which versions of the packages below you have installed? It might be a version issue, and I can try to install your versions to check. ```...
Yes, that would be what is fundamentally causing the problem, but that doesn't narrow down *where* the error occurs. On all the platforms I have access to, the error is...
If you manage to find out what triggers the error for your `jskm` package, I would also love to hear what you did. Maybe it would work for me as...
Graph isomorphism is a hard problem (of unknown complexity) so we didn't try to filter. It might be easier for admixture graphs because they have regularities that general graphs do...
I guess it has grown too old and then incompatible with younger R versions, and therefore has been removed from CRAN. I changed job earlier in the year, and currently...
The new non-local return solution to handling `with` expressions will also make it possible to handle loops.
A compressed suffix tree (see slides) is just an array and thus easy to serialise. I just need code for compressing a suffix tree, then.
With the LCP algorithm, we can serialise by writing the SA and LCP arrays to disk. That is the easiest way to do it.
You would restart in the wrong state. The iterator needs to know what the longest border is at this position, which is in b. If you use b - 1...