musings

I realised I haven't written down anything for a long time. The month of March had been a roller-coaster ride with its ups and downs. I must apologise to everyone bornt in this semester as I really had no time to buy any presents for anyone.

Just today, I borrowed the book "Algorithms on strings, trees and sequences" by Dan Gusfield. I'm very amused because in the preface, there was this sentence:

"The model reader is a research-level professional in computer science or a graduate or advanced undergraduate student in computer science, although there are many biologist (and of course mathematicians) with sufficient algorithmic background to read the book."

Hehehe I don't fit into any of the description of a model reader. I do find it interesting to note that stuff like network flow (It is hard to find good text on dinic's algorithm) and suffix trees are only taught in graduate level. Currently I'm still trying to find a text on "blossom shrinking" for matching on general graph. No good source found yet.

Back to more coding. I will have to create an extremely difficult programming question on strings. Die by KMP/Suffix trees/DP/Whatever difficult graph algorithm that I can come up with.