Regarding the explanation of the suffix tree method, here is the link:
http://algo2006.csie.dyu.edu.tw/paper/2/A24.pdf
On Tue, Jan 24, 2012 at 8:05 PM, Ashish Goel ashg...@gmail.com wrote:
http://www.akalin.cx/longest-palindrome-linear-time
lovely explanation..
Best Regards
Ashish Goel
http://www.akalin.cx/longest-palindrome-linear-time
lovely explanation..
Best Regards
Ashish Goel
Think positive and find fuel in failure
+919985813081
+919966006652
On Tue, Jan 24, 2012 at 7:52 PM, Ashish Goel ashg...@gmail.com wrote:
while suffix tree of str and reverse(str) and finding
So, suggest some approach plz for this ques.
On Aug 22, 12:59 am, Dave dave_and_da...@juno.com wrote:
@Sanjay: Will method 1 really work? What would it return on the string
abraxyzarba? The longest common substring between this string and
its reverse is abra, but how does that relate to the
Hey Geeks I think question can be solved by many ways . some of the
algorithms are i have implemented aware of are -
1st. Algo
Generate all palindromes (even odd length ) of given string while keep
tracking of their length in last just compare max (evenlength_palindrome ,
@ harry how it is possible man
On Mon, Aug 22, 2011 at 3:58 AM, WgpShashank shashank7andr...@gmail.comwrote:
Hey Geeks I think question can be solved by many ways . some of the
algorithms are i have implemented aware of are -
1st. Algo
Generate all palindromes (even odd length ) of given
can yo tell exactly , how the suffix tree is used for finding
palindromes?
On Aug 22, 3:58 am, WgpShashank shashank7andr...@gmail.com wrote:
Hey Geeks I think question can be solved by many ways . some of the
algorithms are i have implemented aware of are -
1st. Algo
Generate all
brute force...http://codepad.org/D07BNo91 There are some
checks to help reduce O(n^2), so I want to say.. O(1.5n) ?=)
#output for str = 'abaccddccefe'
#ccddcc 6
#for str = 'abraxyzarba'
#a 1
On Aug 22, 1:09 pm, uma umai...@gmail.com wrote:
can yo tell exactly , how the suffix
sorry, I meant to joke about (0.5 * n^2) ;P
On Aug 22, 4:46 pm, icy` vipe...@gmail.com wrote:
brute force... http://codepad.org/D07BNo91 There are some
checks to help reduce O(n^2), so I want to say.. O(1.5n) ? =)
#output for str = 'abaccddccefe'
#ccddcc 6
#for str =
Manacher's algorithm does. I think it's a variant of Z algorithm.
On Dec 31 2010, 5:10 am, Aniket aniket...@gmail.com wrote:
How do you find the longest palindrome in a given string in O(n) time?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
@Anand post correct algorithm. There is no simpler method to find longest
palindrome in a linear time. To understand the algorithm you may be should
know the Z algorithm cause main idea is the same.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
@Anand:I went through the link posted in your blog.But I found the
method little bit hard to understand.
@Aviral:Please elaborate the approach or give some link as in your
blog I didn't find the solution.
It will be very helpful.Thanks in advance.
--
You received this message because you are
11 matches
Mail list logo
