Fast Algorithms for Exact String Matching
arxiv.org
arxiv.org
You'd build the suffix tree from the haystack, whereas their algorithm preprocesses the needle.
So I guess it mostly depends if you're going to be repeatedly searching different strings in the same document, or if you're searching for the same string in many different documents. Plus, space requirements might be relevant too, as a preprocessed haystack is probably bigger than a preprocessed needle.
(Also, don't forget that on HN a small number of reposts is ok if a story hasn't had significant attention yet: https://news.ycombinator.com/newsfaq.html. Otherwise what makes it off /newest is dominated by randomness.)
We can help 'propel' things for a few hours, but after that the posts look weird on the front page, e.g. if they have say 3 points and are many hours old. Plus we want to be able to invite reposts for things that are much older. If we notice—or anyone points out—a years-old submission that was fabulous and went nowhere, let's give it another shot. That's not an uncommon case.
If anyone can suggest a better solution than "make a new post in append-only fashion" I'd love to hear it.
Command tab category: "featured", where submissions are ordered in a way that certain "editor's choice" submissions are boosted.
This solves the problem of propelled posts looking "weird" on the front page; they look weird where that is the behavior.
"Featured" doesn't have to be ever-present; if there is nothing being featured at the moment, the link can disappear. Its intermittent manifestation could help get it noticed and used.
But, this paper is really weird. The abstract makes no sense (from a readability perspective, it just dives right in). It's more of a brain dump from the creators than anything relevant to a wider audience. How about a concrete implementation somewhere instead of LaTeX psuedocode?