Replacing palindrome substrings of an input string with a given string. Any effecient algorithm?

Discussion in 'C Programming' started by Tung Chau, Aug 6, 2004.

  1. Tung Chau

    Tung Chau Guest

    Hi,
    I need help with an efficient algorithm of the above problem.
    Suffix tree does not seem to help much in this case.
    Any idea? Please help. Thanks alot.
    Tung Chau
     
    Tung Chau, Aug 6, 2004
    #1
    1. Advertisements

Want to reply to this thread or ask your own question?

It takes just 2 minutes to sign up (and it's free!). Just click the sign up button to choose a username and then you can ask your own questions on the forum.
Similar Threads
  1. DKode

    effecient template system

    DKode, Jun 7, 2005, in forum: ASP .Net
    Replies:
    2
    Views:
    429
    DKode
    Jun 8, 2005
  2. Will McGugan

    Replacing large number of substrings

    Will McGugan, Sep 4, 2005, in forum: Python
    Replies:
    3
    Views:
    424
    Michael J. Fromberger
    Sep 4, 2005
  3. amadain
    Replies:
    11
    Views:
    650
    Paul McGuire
    Feb 14, 2007
  4. Tung Chau
    Replies:
    1
    Views:
    569
    SM Ryan
    Aug 6, 2004
  5. DarthBob88

    Finding and Replacing Substrings In A String

    DarthBob88, Sep 23, 2007, in forum: C Programming
    Replies:
    7
    Views:
    698
    Keith Thompson
    Sep 23, 2007
  6. Karsten Wutzke
    Replies:
    3
    Views:
    446
    Jeff Higgins
    Mar 20, 2008
  7. yazna
    Replies:
    0
    Views:
    647
    yazna
    May 7, 2010
  8. Andrew Tomazos

    Counting Palindrome Substrings ?

    Andrew Tomazos, Feb 5, 2011, in forum: C++
    Replies:
    1
    Views:
    1,404
    Ben Pfaff
    Feb 5, 2011
Loading...