• ADS
  • Facebook: Degrees of Separation

    Humans are (for the most part) social animals, we thrive when we congregate and poll our resources together. So how interconnected are we? Poets, screen writers and scientists have all posed the question but up until recently there’s never really been a good measure of the degrees of separation between any two people. Six degrees of […]

  • ADS
  • ADS: Boyer Moore String Search

    Much like Naive Matching the Boyer-Moore algorithm solves the problem of finding a sub-string in a string. The difficulty of this mirrors that of the needle in a haystack problem. One of the foremost differences between the two is efficiency. The Boyer-Moore algorithm is seen as a benchmark for practical string search and is widely used in tasks […]

  • ADS
  • ADS: Naive Matching

    Finding a sub-string in a longer string seems like a rather trivial and boring task. I’m not disagreeing. But surprisingly it is abstract enough to have applications in places like sequence alignment in bioinformatics to simply pressing CTRL + F and searching for a word on the page loaded in your browser. So to begin, let’s formalise […]