https://hackerpaper.kaipfister.de/p/1307.1417/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=14686399urn:hackerpapers:mention:1307.1417:14686399Mon, 03 Jul 2017 06:58:54 GMT<p>OP and author here :) Python is not the fastest programming language in the world either. As I said, I wanted something simple (less than 20 lines and quite readable) that performs well against random data. It is NOT intended to be used in production. You would have to add some checks for border cases and things like that. Plus it uses a lot of memory (although linear) because of the set and the dict, which is a drawback that the original implementation (suffix_matrix_stanford) does not have. I clearly took simplicity over efficiency, and the advantage of this particular algorithm is that you…</p><p><a href="https://hackerpaper.kaipfister.de/p/1307.1417/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DS