google for edit distance problem and use costs for all operations to be 1, and if edit distance is < err return true else false
On Nov 27, 2007 10:56 PM, John <[EMAIL PROTECTED]> wrote: > > Implement strstr(string, pattern, err) > Where you want to find out whether the pattern occurs in string, > allowing upto err number of errors in matching. > > Let ABC be the pattern to match, and let err be 1 > Where an error is : > a. omission : i.e. even AB should match > b. replacement : i.e. even AXC would match > c. addition : i.e. even ABXD would match > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
