There is a beautiful blog from Benchling Engineering where they used a suffix tree and depth-first search to solve a problem related to finding the longest common sub-string. What makes it very interesting is that the problem is something that originates from a first-year biology and computer science course’s context. On the other hand, it’s downright sad because this kind of frontier innovation scope is quite limited in Bangladesh because we are somehow stuck around the idea that we have to be the cheapest solution to any problem.