Given that you have one string of length N and M small strings of length L . How do you efficiently find the occurrence of each small string in the larger one
I heard the best solution for this problem is to use generalized suffix tree. Can any one explain the solution for this problem in detail -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
