Magic
If I told you it was possible to search a pattern in a text, no matter how large the text, in the time it takes to read the pattern, wouldn’t you say: “Only by magic!”
View ArticleAbstraction
Say we want to remove all multiple consecutive letters by a single one, i.e. for an input like aaaccceeefff (lowercase, sorted) we want an output like acef. There are conceptually different approaches...
View ArticleTopCoder Algorithm Competition Eclipse Plug-in
As the latest version of my little Eclipse Plug-in for TopCoder Algorithm Competitions which I made available here on my blog was a little outdated and buried in an older post, and since I just fixed a...
View ArticleSuffix trees Eclipse Plug-in
I’ve made a small bugfix and am taking that occasion to blog about my little Eclipse Plug-in that automatically draws suffix trees with Dot/Graphviz for an entered text (in the context of the Suffix...
View ArticleLiterate string matching programs
I’ve added two little implementations to the literate programs wiki: string matching using the Boyer-Moore algorithm and a DP-based computation of the Levenshtein distance. I really like literate...
View Article