HI, The above problem can be solved by suffix trees in linear time.
http://www.allisons.org/ll/AlgDS/Tree/Suffix/ On Jul 27, 9:02 pm, Harsha Nagesh <harshasnag...@gmail.com> wrote: > Hi, > > Given a string, I am interested in finding all repeated substrings > of any length (not just the longest substring). Can anybody point me > to the right algorithm/literature for this problem? > > My original problem is finding repeated subtrees in a tree that has > nodes of different kind. My plan is to convert the tree into a prefix > notation and solve the above mentioned substring problem. > > Thanks > Harsha -- 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.
