Laste ned presentasjonen
Presentasjon lastes. Vennligst vent
1
String-Matching II Jan Salmen
2
String-Matching II Boyer-Moore Algorithmus
3
1.1 Bad character Strategie... oh, der String is n Zeichen lang... Muster s
4
... oh, der String is n Zeichen lang... Muster s j = m = 6j = m = 6
5
... oh, der String is n Zeichen lang... Muster s j = m = 6j = m = 6
6
... oh, der String is n Zeichen lang... Muster s j = 5j = 5
7
... oh, der String is n Zeichen lang... Muster s j = 4j = 4
8
... oh, der String is n Zeichen lang... Muster Muster ? s+1 s
9
... oh, der String is n Zeichen lang... Muster Muster ? s+2 s
10
... oh, der String is n Zeichen lang... Muster Muster ? s s+3
11
... oh, der String is n Zeichen lang... Muster s j = 4j = 4
12
... oh, der String is n Zeichen lang... Muster s j = 4j = 4 d is bad character
13
... oh, der String is n Zeichen lang... Muster s j = 4j = 4 d is bad character d does not appear in Muster
14
... oh, der String is n Zeichen lang... Muster s j = 4j = 4 d is bad character d does not appear in Muster possible shift: j
15
... oh, der String is n Zeichen lang... Muster s+4
16
... oh, der String is n Zeichen lang... Muster s+4 j = 6j = 6
17
... oh, der String is n Zeichen lang... Muster s+4 j = 6j = 6
18
... oh, der String is n Zeichen lang... Muster s+4 j = 5j = 5
19
... oh, der String is n Zeichen lang... Muster s+4 j = 5j = 5 t is bad character
20
... oh, der String is n Zeichen lang... Muster s+4 j = 5j = 5 t is bad character t is at Position 4 in Muster
21
... oh, der String is n Zeichen lang... Muster s+4 j = 5j = 5 t is bad character t is at Position 4 in Muster possible shift: 5 – 4 = 1
22
... oh, der String is n Zeichen lang... Muster s+4 j = 5j = 5 t is bad character t is at Position 4 in Muster possible shift: 5 – 4 = 1 (generally: j – k)
23
... oh, der String is n Zeichen lang... Muster s+5
24
... oh, der String is n Zeichen lang... Muster s+5 j = 6j = 6
25
... oh, der String is n Zeichen lang... Muster s+5 j = 6j = 6
26
... oh, der String is n Zeichen lang... Muster s+11
27
... oh, der String is n Zeichen lang... Muster s+11 j = 6j = 6
28
... oh, der String is n Zeichen lang... Muster s+11 j = 6j = 6
29
... oh, der String is n Zeichen lang... Muster s+13
30
c Σ Muster a e m r s t u M
31
a 0 e 5 m 0 r 6 s 3 t 4 u 2 M 1 c Σ Muster Last occurence Function loc(c) = k
32
a 0 e 5 m 0 r 6 s 3 t 4 u 2 M 1 Shift: j – k c Σ Muster Last occurence Function loc(c) = k
33
k < j :Shift 1... oh, der String is n Zeichen lang... Muster j = 5j = 5 Shift: j – k loc(c) = k
34
k < j :Shift 1 k = 0 : Shift over j... oh, der String is n Zeichen lang... Muster j = 6j = 6 Shift: j - k loc(c) = k
35
k < j :Shift 1 k = 0 : Shift over j k = j : not possibly... oh, der String is n Zeichen lang... Muster j = 6j = 6 Shift: j - k loc(c) = k
36
k < j :Shift 1 k = 0 :Shift over j k = j :not possible k > j :Shift < 0... oh, der Beer is n Zeichen lang... Muster Shift: j - k j = 4j = 4 loc(c) = k
37
For all c Σ loc(c) = 0 For all i {1,..., m} loc(P[m]) = i
![For all c Σ loc(c) = 0 For all i {1,..., m} loc(P[m]) = i](http://images.slideplayer.no/3/1345529/slides/slide_37.jpg "For all c Σ loc(c) = 0 For all i {1,..., m} loc(P[m]) = i")
38
For all c Σ loc(c) = 0 For all i {1,..., m} loc(P[m]) = i Running time : O( |Σ| + m)
![For all c Σ loc(c) = 0 For all i {1,..., m} loc(P[m]) = i Running time : O( |Σ| + m)](http://images.slideplayer.no/3/1345529/slides/slide_38.jpg "For all c Σ loc(c) = 0 For all i {1,..., m} loc(P[m]) = i Running time : O( |Σ| + m)")
Liknende presentasjoner
