Oleksandr Kulkov

Also take a note of #1298, which addresses a similar concern.

I think it's best to also rewrite C++ code with a newer standard to match the Python style. But could you please test both implementations on one of the example...

Hi, this is a brief non-update. Yes, I will look into this, but it might take a bit more time.

Thanks for the pull request! I also prefer this implementation. Moreover, I would also use half-open intervals, rather than segments. The main issue here is that all the other places...

``` [ FAILED ] 10 tests, listed below: [ FAILED ] DeBruijnGraphTest/4.CallStartNodes, where TypeParam = mtg::graph::DBGSSHash [ FAILED ] DeBruijnGraphTest/4.CallUnitigsWithoutTips, where TypeParam = mtg::graph::DBGSSHash [ FAILED ] DeBruijnGraphTest/4.CallUnitigsWithoutTips2, where TypeParam...

@hmusta hi, what's the current plan with this PR? As in, who should work on it at this point? I can try to implement the stuff that I suggested in...

Hi there! What appears to be the problem in the mentioned article?

Thanks! I'm not very familiar with linear-time suffix array construction algorithms, but random places over the internet claim that SA-iS is simpler and faster than Kärkkäinen-Sanders, is that true? I...

Ideally we'd rely on some benchmarks, for example implement both algorithms (in an as simple way as possible) and see how they fare on [Library Checker](https://judge.yosupo.jp/problem/suffixarray). Then, if the performance...

Yes, let's do it then.