Finding longest and most repeated substring

dayzman_at_hotmail.com
Date: 02/10/05 

Date: 9 Feb 2005 18:07:19 -0800

Hi,

I'm trying to find the longest and most repeated substring using a
suffix tree. For example, with the string "20120120120120120201201201",
I would like the result to be "201". I've been trying to look at the
immediate children of the root and count their leaves. The result turns
out to be "20", because I'm taking the child with the most leaves as my
result. Am I doing something wrong? Is there a better solution for my
problem?

Cheers,
Michael

Relevant Pages

  • Finding longest and most repeated substring
    ... I'm trying to find the longest and most repeated substring using a ... suffix tree. ... For example, with the string "20120120120120120201201201", ... because I'm taking the child with the most leaves as my ...
    (comp.programming)
  • Re: Finding longest and most repeated substring
    ... Well, to me, the longest repeated substring in ... then the longest repeated substring is: ... it isn't the most repeated string. ...
    (comp.programming)
  • Re: Finding longest and most repeated substring
    ... Well, to me, the longest repeated substring in ... then the longest repeated substring is: ... it isn't the most repeated string. ...
    (comp.theory)
  • [SUMMARY] Longest Repeated Substring (#153)
    ... string size, try to find a string of that length that occurs twice in the full ... longest repeated substring is typically less than 200 bytes. ... The idea of a suffix tree is to build a list of every suffix that occurs in the ... if distance < at_least_size ...
    (comp.lang.ruby)
  • Re: Which data structure should Iuse for fast retrieval
    ... "YKUT" wrote in message ... string involves finding a starting point (max 256 compares) then following ... There are heaps of resources for suffix tree construction on the web. ...
    (microsoft.public.vc.mfc)