1 / 14

Parametrized Matching Amir, Farach, Muthukrishnan

Parametrized Matching Amir, Farach, Muthukrishnan. Orgad Keller. Parametrized Match Relation. Definition: Two strings over the alphabet , parametrized match (p-match) if the following 3 conditions apply :.

solada
Download Presentation

Parametrized Matching Amir, Farach, Muthukrishnan

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Parametrized MatchingAmir, Farach, Muthukrishnan Orgad Keller

  2. Parametrized Match Relation • Definition: Two strings over the alphabet , parametrized match (p-match) if the following 3 conditions apply : Orgad Keller - Algorithms 2 - Recitation 9

  3. Conditions Orgad Keller - Algorithms 2 - Recitation 9

  4. Example • We can see it as a bijection : Orgad Keller - Algorithms 2 - Recitation 9

  5. Parametrized Matching • Input: • Output: All locations where p-matches . Orgad Keller - Algorithms 2 - Recitation 9

  6. Observation • We can reduce the problem, to the same problem with (m-match). • Given we’ll define : Orgad Keller - Algorithms 2 - Recitation 9

  7. Observation • Now is over and is over and . • We get the algorithm for p-match: • Create • Find all the places appears in (using KMP) • Find all the places m-matches in (We’ll show later how) • Return Orgad Keller - Algorithms 2 - Recitation 9

  8. Exercise • Why is that enough? • In other words: Prove there is a p-match at location iff . • We are left with the question: How do we solve step 3 efficiently? Orgad Keller - Algorithms 2 - Recitation 9

  9. M-match • Is m-match transitive? • We can use KMP-like automaton method • For each index in pattern, we want to find the longest suffix that m-matches the prefix. • For instance: Orgad Keller - Algorithms 2 - Recitation 9

  10. Failure Links • Where to link the failure link from ? • In KMP it is simple: If then link to . Otherwise go back again and repeat. • In our case: • If never appeared before, i.e. We link if . • Otherwise, we link if such that , it holds that . Orgad Keller - Algorithms 2 - Recitation 9

  11. Failure Links • Can we do this efficiently? • We’ll build an array : • So, if , we know hasn’t appeared before. Otherwise, we’ll know exactly where it had appeared last. Orgad Keller - Algorithms 2 - Recitation 9

  12. Building the Array • We’ll hold a Balanced Binary Search Tree for the symbols of the alphabet. Initially it will be empty. • We’ll go over the pattern. For each symbol, if it isn’t in the tree, we’ll add it with it’s index and update . Otherwise, we know exactly where it had last appeared, so we’ll update and then update the symbol in the tree with the new index. • Time: where . Orgad Keller - Algorithms 2 - Recitation 9

  13. The Matching Itself • We go forward in the automaton if either • and . • We’ll hold and update a balanced BST as we go over the text as well. • Time: • So overall algorithm time is • Can we improve this further? Orgad Keller - Algorithms 2 - Recitation 9

  14. The Trick • We’ll split the text into overlapping segments of size like this: • So every match in the text must appear in whole in one of the segments. • We’ll run the algorithm for each such segment. Time: where . • Overall for all segments: Orgad Keller - Algorithms 2 - Recitation 9

More Related