notebooks
Languages and libraries
suffix array construction
SHOW HN2017
How HN took it
0 positive, 1 neutral or asking, 0 mixed, 3 critical, out of 4 comments about the project.
Performance: 0 for, 3 against
The thread, comment by comment
Each row is a top-level comment and its replies, in HN's order. Select a cell to open that comment on HN.
positive neutral or mixed critical about another commenter or something else the maker
What HN said
What people liked
Readable and interesting reference implementation
From 1 comment
"Suffix arrays : How to compute them fast with Python" The assumption is it's fast in Python without using Cython etc. My intuition says that looping and iterating in Python is…
lqdc13 on HN
Objections
No comparison benchmarks against other implementations
From 2 comments
Is there another implementation we can compare this with? Kind of crazy to say that this is fast without any comparisons with anything else. So far I've been using suffix trees…
lqdc13 on HNArticle seems to be mostly about efficient, not fast.
dom0 on HN
Pure Python is slow compared with C or divsufsort-style algorithms
From 2 comments
There are much faster SA construction algorithms than skew (check out divsufsort). The O(n) algorithms using induced sorting are also likely much faster than this work. The…
matt4711 on HN"Suffix arrays : How to compute them fast with Python" The assumption is it's fast in Python without using Cython etc. My intuition says that looping and iterating in Python is…
lqdc13 on HN
Uses a lot of memory due to set and dict
From 1 comment
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…
Labo333 on HN
Requests
Compare against other implementations
From 2 comments
Is there another implementation we can compare this with? Kind of crazy to say that this is fast without any comparisons with anything else. So far I've been using suffix trees…
lqdc13 on HNYou can test it against https://unicredit.github.io/cello/
pathsjs on HN
Ship the code in a single file
From 1 comment
Cool page! It would be really great to have the code shipped in a single file so that people can use it! I love Jupyter notebooks because 1) they are beautiful 2) if you download…
Labo333 on HN
Questions
Pointers to parallel suffix array construction algorithms
From 1 comment
Hi, do you have some pointers for "linear speedup parallel SA construction algorithms." ? Thanks!
pelario on HN
Alternatives named
divsufsort (libdivsufsort)
From 1 comment
There are much faster SA construction algorithms than skew (check out divsufsort). The O(n) algorithms using induced sorting are also likely much faster than this work. The…
matt4711 on HN
Cello suffix array implementation
From 1 comment
You can test it against https://unicredit.github.io/cello/
pathsjs on HN
Doug's MM suffix array C implementation
From 1 comment
When i was doing a derivation of LZ compression using suffix arrays i used induced sorting. Here is a good overview: http://zork.net/~st/jottings/sais.html. Also i think Doug's C…
xfer on HN
sary
From 1 comment
Anyone remember "sary"? It was doing suffix arrays 17 years ago. Last update was in 2005. http://sary.sourceforge.net/
visarga on HN