LecX6

# LecX6 - COT 6936 Topics in Algorithms Giri Narasimhan ECS...

This preview shows pages 1–4. Sign up to view the full content.

1 2/25/10 COT 6936 1 COT 6936: Topics in Algorithms Giri Narasimhan ECS 254A / EC 2443; Phone: x3748 http://www.cs.fiu.edu/~giri/teach/COT6936_S10.html https://online.cis.fiu.edu/portal/course/view.php?id=427 The String Matching Problem 2/25/10 COT 6936 2 Pattern P Text T Set of Locations L Approximate String Matching Input: Text T , Pattern P Questions: Does P occur in T ? Find one/all occurrence of P in T . Count # of occurrences of P in T . Find longest substring of P in T . Find closest substring of P in T . Locate direct repeats of P in T . 2/25/10 COT 6936 3 Many more variants

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2 String Matching Algorithms • Find all occurrences of P in T . ± Naïve Method ± Rabin-Karp Method ± FSA-based method ± Knuth-Morris-Pratt algorithm ± Boyer-Moore ± Suffix Tree method ± Shift-And method ± Suffix Arrays ± Methods based on Burrows-Wheeler transform 2/25/10 COT 6936 4 Naïve Strategy 2/25/10 COT 6936 5 ATAQAANANASPVANAGVERANANESISITALVDANANANANAS ANANAS ANANAS ANANAS ANANAS Finite State Automata 2/25/10 COT 6936 6 4 5 3 6 1 7 A N A N A S ATAQAANANASPVANAGVERANANESISITALVDANANANANAS A A N A Finite State Automaton 2 ANANAS A
3 State Transition Diagram 2/25/10 COT 6936 7 A N S * - 0

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 9

LecX6 - COT 6936 Topics in Algorithms Giri Narasimhan ECS...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online