Longest Closed Factor Array of a string w and an algorithm which computes it in O(n log n / loglog n) time and O(n) space.
n is the length of w.
Closed Factorization of a string w and the algorithm which compute it in O(n) time and space.
n is the length of w.
Hello sir/madam.
I can make your application for Longest Closed Factor Array.
Please specify what programming language you want (c/c++/java...).
And when is due date.
Regards
I have 18 years experience in Data Structures &Algorithms. I will get this done in a short interval of time.
I have gone through the document, and this looks like a suitable task.
My Greetings,
I just saw your base reference paper and the .ppt explanation of the algorithm.
I Will Offer you make this Algorithm inside Matlab .m files
Keep in Touch.
Thanks in Advance