Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Standard view
Full view
of .

1 Text retrieval systems
1.1 Basic notions and notations
1.2 Classiﬁcation of pattern matching problems
1.3 Two ways of pattern matching
1.4 Finite automata
1.5 Regular expressions
1.5.1 Deﬁnition of regular expressions
2 Forward pattern matching
2.1 Elementary algorithm
2.2 Pattern matching automata
2.2.1 Exact string and sequence matching
2.2.2 Substring and subsequence matching
2.2.3 Approximate string matching - general alphabet
2.2.4 Approximate string matching - ordered alphabet
2.2.5 Approximate sequence matching
2.2.6 Matching of ﬁnite and inﬁnite sets of patterns
2.2.7 Pattern matching with “don’t care” symbols
2.2.8 Matching a sequence of patterns
2.3 Some deterministic pattern matching automata
2.3.1 String matching
2.3.2 Matching of a ﬁnite set of patterns
2.3.3 Regular expression matching
2.3.4 Approximate string matching – Hamming distance
2.3.5 Approximate string matching – Levenshtein distance
2.4.1 Construction of a dictionary matching automaton
2.4.2 Approximate string matching
2.5 (∆, Γ) distance
2.6 ∆ distance
3 Finite automata accepting parts of a string
3.1 Preﬁx automaton
3.2 Suﬃx automaton
3.3 Factor automaton
3.4 Parts of suﬃx and factor automata
2. Front end of suﬃx or factor automaton
3.4.1 Backbone of suﬃx and factor automata
3.4.2 Front end of suﬃx or factor automata
3.4.3 Multiple front end of suﬃx and factor automata
3.5 Subsequence automata
3.6 Factor oracle automata
3.7 The complexity of automata for parts of strings
3.8 Automata for parts of more than one string
3.9 Automata accepting approximate parts of a string
4 Borders, repetitions and periods
4.1 Basic notions
4.2 Borders and periods
4.2.1 Computation of borders
4.2.2 Computation of periods
4.3 Border arrays
4.4 Repetitions
4.4.1 Classiﬁcation of repetitions
4.4.2 Exact repetitions in one string
4.4.3 Complexity of computation of exact repetitions
4.4.4 Exact repetitions in a ﬁnite set of strings
Computation of repetitions in a ﬁnite set of strings
4.4.5 Computation of approximate repetitions
4.4.6 Approximate repetitions – Hamming distance
4.4.7 Approximate repetitions – Levenshtein distance
4.4.8 Approximate repetitions – ∆ distance
4.4.9 Approximate repetitions – Γ distance
4.4.10 Approximate repetitions – (∆,Γ) distance
4.4.11 Exact repetitions in one string with don’t care symbols
4.5 Computation of periods revisited
5.1 Searching automata
5.2 MP and KMP algorithms
5.3 AC algorithm
6.1 Basic simulation method
6.1.1 Implementation
6.2 Dynamic programming
6.2.1 Algorithm
6.2.2 String matching
6.2.3 Time and space complexity
6.3 Bit parallelism
6.3.1 Algorithm
6.3.2 String matching
6.3.4 Time and space complexity
References
0 of .
Results for:
P. 1
Tsa Lectures 1

# Tsa Lectures 1

Ratings: (0)|Views: 54|Likes:

### Availability:

See more
See less

06/19/2015

pdf

text

original

Pages 5 to 68 are not shown in this preview.