Fundamental algorithms for a declarative pattern matching system:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | German |
| Veröffentlicht: |
Bielefeld
Techn. Fak. der Univ. Bielefeld, Abt. Informationstechnik
1995
|
| Schriftenreihe: | Universität <Bielefeld> / Abteilung Informationstechnik: Forschungsberichte der Technischen Fakultät, Abteilung Informationstechnik
1995,3 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Zugl.: Bielefeld, Univ., Diss., 1995 |
| Beschreibung: | IV, 237 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010734534 | ||
| 003 | DE-604 | ||
| 005 | 19960821 | ||
| 007 | t | ||
| 008 | 960422s1995 gw d||| m||| 00||| ger d | ||
| 016 | 7 | |a 947270965 |2 DE-101 | |
| 035 | |a (OCoLC)75715203 | ||
| 035 | |a (DE-599)BVBBV010734534 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-355 |a DE-91 |a DE-29T |a DE-11 |a DE-83 | ||
| 084 | |a ZN 6030 |0 (DE-625)157495: |2 rvk | ||
| 084 | |a DAT 652d |2 stub | ||
| 084 | |a DAT 544d |2 stub | ||
| 100 | 1 | |a Kurtz, Stefan |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Fundamental algorithms for a declarative pattern matching system |c Stefan Kurtz |
| 264 | 1 | |a Bielefeld |b Techn. Fak. der Univ. Bielefeld, Abt. Informationstechnik |c 1995 | |
| 300 | |a IV, 237 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Universität <Bielefeld> / Abteilung Informationstechnik: Forschungsberichte der Technischen Fakultät, Abteilung Informationstechnik |v 1995,3 | |
| 500 | |a Zugl.: Bielefeld, Univ., Diss., 1995 | ||
| 650 | 0 | 7 | |a Funktionale Programmierung |0 (DE-588)4198740-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mustervergleich |0 (DE-588)4307192-2 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Mustervergleich |0 (DE-588)4307192-2 |D s |
| 689 | 0 | 1 | |a Funktionale Programmierung |0 (DE-588)4198740-8 |D s |
| 689 | 0 | 2 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 810 | 2 | |a Abteilung Informationstechnik: Forschungsberichte der Technischen Fakultät, Abteilung Informationstechnik |t Universität <Bielefeld> |v 1995,3 |w (DE-604)BV010126111 |9 1995,3 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007166877&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007166877 | |
Datensatz im Suchindex
| _version_ | 1808137425758715904 |
|---|---|
| adam_text |
CONTENTS
1
MOTIVATION
AND
OVERVIEW
1
2
FUNCTIONAL
PROGRAMMING
CONCEPTS
7
2.1
AN
INTRODUCTION
TO
MIRANDA
.
10
2.1.1
TYPES
.
10
2.1.2
FUNCTIONS
.
12
2.1.3
LIST
COMPREHENSIONS
.
14
2.1.4
NON-STRICT
FUNCTIONS
AND
INFINITE
DATA
STRUCTURES
.
15
2.2
THE
MODEL
OF
COMPUTATION
.
16
2.3
MONADS
.
17
2.3.1
STATE
TRANSFORMERS
.
19
2.3.2
ARRAY
TRANSFORMERS
.
.
20
2.4
EXTENSIONS
TO
MIRANDA
.
22
3
THE
STRING
PROCESSING
MACHINERY
23
3.1
BASIC
DEFINITIONS
AND
NOTATIONS
.
24
3.2
X
+
-TREES
.
25
3.2.1
SUFFIX
LINKS
.
25
3.2,2
LOCATIONS
.
26
3.3
SUFFIX
TREES
.
29
3.3.1
APPLICATIONS
.
30
3.3.2
SPACE
REQUIREMENTS
.
31
3.3.3
THE
SENTINEL
CHARACTER
.
32
3.4
IMPLEMENTATION
.
33
3.4.1
STRINGS
.
33
3.4.2
EDGE
LABELS
.
34
3.4.3
EDGE
SETS
.
35
3.4.4
ATOMIC
X
+
-TYEES
.
36
II
CONTENTS
3.4.5
COMPACT
X
+
-TREES
.
37
3.4.6
LOCATIONS
.
38
3.5
SUFFIX
TREE
ALGORITHMS
.
40
3.5.1
THE
LAZY
SUFFIX
TREE
ALGORITHM
.
41
3.5.2
UKKONEN
'
S
ONLINE
SUFFIX
TREE
ALGORITHM
.
43
3.5.3
MCCREIGHT
'
S
SUFFIX
TYEE
ALGORITHM
.
47
3.6
IMPLEMENTATION
OF
SUFFIX
TREE
ALGORITHMS
.
51
3.6.1
THE
LAZY
SUFFIX
TREE
ALGORITHM
.
51
3.6.2
TREE
TRANSFORMERS
.
53
3.6.3
COMPACT
TREE
TRANSFORMERS
.
56
3.6.4
LOCATIONS
.
.
.
.
.
57
3.6.5
UKKONEN
'
S
ONLINE
SUFFIX
TREE
ALGORITHM
.
58
3.6.6
MCCREIGHT
'
S
SUFFIX
TREE
ALGORITHM
.
59
3.7
COMPUTING
SUFFIX
LINKS
AND
ANNOTATIONS
.
61
3.7.1
SUFFIX
LINKS
FOR
ATOMIC
X
+
-TREES
.
62
3.7.2
SUFFIX
LINKS
FOR
COMPACT
SUFFIX
TREES
.
63
3.7.3
ANNOTATIONS
FOR
COMPACT
SUFFIX
TYEES.
66
3.7.4
MERGING
THE
COMPUTATIONS
.
67
3'8
DETERMINISTIC
FINITE
AUTOMATA
.
69
3.8.1
IMPLEMENTATION
.
70
3.9
STRING
COMPARISONS
.
72
3.9.1
THE
EDIT
DISTANCE
MODEL
.
72
3.9.2
THE
MAXIMAL
MATCHES
MODEL
.
77
3.9.3
THE
Q-GRAM
MODEL
.
79
3.9.4
SIGNIFICANCE
OF
THE
MODELS
IN
MOLECULAR
BIOLOGY
.
82
3.9.5
IMPLEMENTATION
.
83
3.10
SUMMARY
.
93
4
EXACT
STRING
SEARCHING
94
4.1
THE
BRUTE
FORCE
ALGORITHM
.
95
4,2
THE
KNUTH-MORRIS-PRATT
ALGORITHM
.
96
4.2.1
IMPLEMENTATION
.
98
4.3
THE
KARP-RABIN
ALGORITHM
.
100
4.3.1
IMPLEMENTATION
.
101
4.4
THE
BOYER-MOORE
ALGORITHM
.
102
CONTENTS
III
4.4.1
THE
GOOD-SUFFIX
HEURISTIC
.
103
4.4.2
THE
BAD-CHARACTER
HEURISTIC
.
107
4.4.3
EFFICIENCY
OF
THE
SEARCH
PHASE
.
109
4.4.4
HORSPOOL
'
S
HEURISTIC
.
110
4.4.5
SUNDAY
'
S
HEURISTIC
.
112
*
4.4.6
IMPLEMENTATION
.
114
4.5
THE
CHANG-LAWLER
ALGORITHM
.
119
4.5.1
IMPLEMENTATION
.
121
4.6
OVERVIEW
OF
THE
IMPLEMENTATIONS
.
125
5
MULTIPLE
EXACT
STRING
SEARCHING
126
5.1
THE
SUFFIX
TREE
SEARCH
ALGORITHM
.
127
5.1.1
IMPLEMENTATION
.
127
5.2
THE
AHO-CORASICK
ALGORITHM
.
128
5.2.1
IMPLEMENTATION
.
129
5.3
OTHER
APPROACHES
.
131
6
APPROXIMATE
STRING
SEARCHING
132
6.1
SELLERS
'
ALGORITHM
.
133
6.1.1
IMPLEMENTATION
.
136
6.2
MEMORIZING
DISTANCE
COLUMNS
.
137
6.2.1
ESSENTIAL
SUFFIXES
.
;
.
138
6.2.2
UKKONEN
'
S
IMPLEMENTATION
TECHNIQUES
FOR
MDC
.
143
6.2.3
AN
ONLINE
IMPLEMENTATION
TECHNIQUE
FOR
MDC
.
144
6.2.4
A
TECHNIQUE
BASED
ON
DETERMINISTIC
FINITE
AUTOMATA
.
145
6.2.5
IMPLEMENTATION
.
148
6.3
PROPERTIES
OF
TABLE
D
.
151
6.4
UKKONEN
'
S
CUTOFF
ALGORITHM
.
153
6.4.1
IMPLEMENTATION
.
153
6.5
UKKONEN
'
S
COLUMN-DFA
.
154
6.5.1
IMPLEMENTATION
.
157
6.6
DIAGONAL
TRANSITION
ALGORITHMS
.
162
6.6.1
THE
BASIC
IDEA
.
163
6.6.2
THE
BRUTE
FORCE
DIAGONAL
TRANSITION
ALGORITHM
.
166
6.6.3
EFFICIENT
COMPUTATION
OF
JUMPS
.
167
6.6.4
IMPLEMENTATION
.
171
IV
CONTENTS
6.7
THE
COLUMN
PARTITION
ALGORITHM
.
178
6.7.1
IMPLEMENTATION
.
182
6.8
CHANG
AND
LAWLER
'
S
FILTERING
TECHNIQUE
.
185
6.8.1
LINEAR
EXPECTED
TIME
ALGORITHM
.
185
6.8.2
IMPROVED
LINEAR
EXPECTED
TIME
ALGORITHM
.
.
.
.
187
6.8.3
SUBLINEAR
EXPECTED
TIME
ALGORITHM
.
189
6.8.4
IMPROVED
SUBLINEAR
EXPECTED
TIME
ALGORITHM
.
191
6.8.5
IMPLEMENTATION
.
191
6.8.6
OTHER
APPROACHES
.
196
6.9
OVERVIEW
OF
THE
IMPLEMENTATIONS
.
197
7
PERFORMANCE
RESULTS
199
7.1
EXACT
STRING
SEARCHING
.
199
7.2
MULTIPLE
EXACT
STRING
SEARCHING
.
201
7.3
APPROXIMATE
STRING
SEARCHING
.
202
8
CONCLUSION
211
A
IMPLEMENTATION
OF
QUEUES
215
B
PREDEFINED
FUNCTIONS
217
BIBLIOGRAPHY
219
INDEX
232 |
| any_adam_object | 1 |
| author | Kurtz, Stefan |
| author_facet | Kurtz, Stefan |
| author_role | aut |
| author_sort | Kurtz, Stefan |
| author_variant | s k sk |
| building | Verbundindex |
| bvnumber | BV010734534 |
| classification_rvk | ZN 6030 |
| classification_tum | DAT 652d DAT 544d |
| ctrlnum | (OCoLC)75715203 (DE-599)BVBBV010734534 |
| discipline | Informatik Elektrotechnik / Elektronik / Nachrichtentechnik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV010734534</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19960821</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960422s1995 gw d||| m||| 00||| ger d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">947270965</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)75715203</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010734534</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-355</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ZN 6030</subfield><subfield code="0">(DE-625)157495:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 652d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 544d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kurtz, Stefan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Fundamental algorithms for a declarative pattern matching system</subfield><subfield code="c">Stefan Kurtz</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Bielefeld</subfield><subfield code="b">Techn. Fak. der Univ. Bielefeld, Abt. Informationstechnik</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IV, 237 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Universität <Bielefeld> / Abteilung Informationstechnik: Forschungsberichte der Technischen Fakultät, Abteilung Informationstechnik</subfield><subfield code="v">1995,3</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Bielefeld, Univ., Diss., 1995</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Funktionale Programmierung</subfield><subfield code="0">(DE-588)4198740-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mustervergleich</subfield><subfield code="0">(DE-588)4307192-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Mustervergleich</subfield><subfield code="0">(DE-588)4307192-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Funktionale Programmierung</subfield><subfield code="0">(DE-588)4198740-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Abteilung Informationstechnik: Forschungsberichte der Technischen Fakultät, Abteilung Informationstechnik</subfield><subfield code="t">Universität <Bielefeld></subfield><subfield code="v">1995,3</subfield><subfield code="w">(DE-604)BV010126111</subfield><subfield code="9">1995,3</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007166877&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007166877</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV010734534 |
| illustrated | Illustrated |
| indexdate | 2024-08-23T00:50:21Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007166877 |
| oclc_num | 75715203 |
| open_access_boolean | |
| owner | DE-355 DE-BY-UBR DE-91 DE-BY-TUM DE-29T DE-11 DE-83 |
| owner_facet | DE-355 DE-BY-UBR DE-91 DE-BY-TUM DE-29T DE-11 DE-83 |
| physical | IV, 237 S. graph. Darst. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| publisher | Techn. Fak. der Univ. Bielefeld, Abt. Informationstechnik |
| record_format | marc |
| series2 | Universität <Bielefeld> / Abteilung Informationstechnik: Forschungsberichte der Technischen Fakultät, Abteilung Informationstechnik |
| spelling | Kurtz, Stefan Verfasser aut Fundamental algorithms for a declarative pattern matching system Stefan Kurtz Bielefeld Techn. Fak. der Univ. Bielefeld, Abt. Informationstechnik 1995 IV, 237 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Universität <Bielefeld> / Abteilung Informationstechnik: Forschungsberichte der Technischen Fakultät, Abteilung Informationstechnik 1995,3 Zugl.: Bielefeld, Univ., Diss., 1995 Funktionale Programmierung (DE-588)4198740-8 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Mustervergleich (DE-588)4307192-2 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Mustervergleich (DE-588)4307192-2 s Funktionale Programmierung (DE-588)4198740-8 s Algorithmus (DE-588)4001183-5 s DE-604 Abteilung Informationstechnik: Forschungsberichte der Technischen Fakultät, Abteilung Informationstechnik Universität <Bielefeld> 1995,3 (DE-604)BV010126111 1995,3 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007166877&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Kurtz, Stefan Fundamental algorithms for a declarative pattern matching system Funktionale Programmierung (DE-588)4198740-8 gnd Algorithmus (DE-588)4001183-5 gnd Mustervergleich (DE-588)4307192-2 gnd |
| subject_GND | (DE-588)4198740-8 (DE-588)4001183-5 (DE-588)4307192-2 (DE-588)4113937-9 |
| title | Fundamental algorithms for a declarative pattern matching system |
| title_auth | Fundamental algorithms for a declarative pattern matching system |
| title_exact_search | Fundamental algorithms for a declarative pattern matching system |
| title_full | Fundamental algorithms for a declarative pattern matching system Stefan Kurtz |
| title_fullStr | Fundamental algorithms for a declarative pattern matching system Stefan Kurtz |
| title_full_unstemmed | Fundamental algorithms for a declarative pattern matching system Stefan Kurtz |
| title_short | Fundamental algorithms for a declarative pattern matching system |
| title_sort | fundamental algorithms for a declarative pattern matching system |
| topic | Funktionale Programmierung (DE-588)4198740-8 gnd Algorithmus (DE-588)4001183-5 gnd Mustervergleich (DE-588)4307192-2 gnd |
| topic_facet | Funktionale Programmierung Algorithmus Mustervergleich Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007166877&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV010126111 |
| work_keys_str_mv | AT kurtzstefan fundamentalalgorithmsforadeclarativepatternmatchingsystem |