CodeGuru Home VC++ / MFC / C++ .NET / C# Visual Basic VB Forums Developer.com
Results 1 to 2 of 2
  1. #1
    Join Date
    Jul 2009

    Long common substring with suffix tree problem

    Hi, folks. I'm trying to implement a generalized suffix tree to solve the longest common substring problem. I'm using the McCreight's algorithm to build the suffix tree. What I'm concerning is how would this algorithm be affected if one of the strings imported is much much longer than others. Will the time and space efficiency be affected? If so, how am I supposed to change the algorithm to make it work better? Thanks very much

  2. #2
    Join Date
    May 2011

    Re: Long common substring with suffix tree problem

    Hi rosoo!

    I saw that you are interested in generalized suffix trees (GSTs) and I'd like to ask you if you have any implementation of GSTs in mind!

    Thank you in advance.

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts

Windows Mobile Development Center

Click Here to Expand Forum to Full Width

On-Demand Webinars (sponsored)

We have made updates to our Privacy Policy to reflect the implementation of the General Data Protection Regulation.