The basic solution which is coming to the mind is to covert string first palindrome and apply livishthein distance to both string(original one and changed string) to check how many substiutions you require for the palindrome.
On Wed, Feb 23, 2011 at 9:11 PM, radha krishnan < radhakrishnance...@gmail.com> wrote: > Dynamic Programming :P > > On Wed, Feb 23, 2011 at 7:19 PM, Balaji S <balaji.ceg...@gmail.com> wrote: > > can anyone help?? > > > > how to convert a string into a palindrome..with MINIMUM NUMBER OF > > SUBSTITUTIONS ( operations..) > > > > -- > > balaji.... ;-) > > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To post to this group, send email to algogeeks@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. > > > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@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. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@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.
