[algogeeks] Re: the lowest number of comparisons in string matching

I know the number of comparisons of KMP algorithm, but I want to find the algorithm which does (in the worst case) the minimal number of comparisons. thanks, laura --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups

[algogeeks] the lowest number of comparisons in string matching

heoretical) is m-n+1, but as far as I know no algorithm has achieved this limit. (where m is the lenght of the text and n is the length of the pattern). Thanks, Laura --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups

[algogeeks] Re: geometry algorithm

s can be rotated by any real angle (in order to obtain a better solution). What I need is an approximation algorithm (which provides a good solution in a reasonable amount of time). Thanks, Laura --~--~-~--~~~---~--~~ You received this message because yo

[algogeeks] geometry algorithm

hanks, Laura --~--~-~--~~~---~--~~ 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 [EMAIL PROT