Approximate string matching: improving data structures and algorithms
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Abschlussarbeit Buch |
Sprache: | English |
Veröffentlicht: |
Berlin
2019
|
Schlagworte: | |
Online-Zugang: | Volltext |
Beschreibung: | 175 Seiten Illustrationen |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV045558901 | ||
003 | DE-604 | ||
005 | 20190509 | ||
007 | t | ||
008 | 190415s2019 a||| m||| 00||| eng d | ||
035 | |a (DE-599)BVBBV045558901 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-188 | ||
084 | |a 000 |2 FUB | ||
100 | 1 | |a Pockrandt, Christopher Maximilian |e Verfasser |0 (DE-588)1183627742 |4 aut | |
245 | 1 | 0 | |a Approximate string matching |b improving data structures and algorithms |c vorgelegt von Christopher Maximilian Pockrandt |
264 | 1 | |a Berlin |c 2019 | |
300 | |a 175 Seiten |b Illustrationen | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
502 | |b Dissertation |c Freie Universität Berlin |d 2019 | ||
650 | 4 | |a approximate | |
650 | 4 | |a fm index | |
650 | 4 | |a string matching | |
650 | 4 | |a search | |
650 | 4 | |a epr dictionaries | |
650 | 4 | |a BWT | |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |a Pockrandt, Christopher Maximilian |t Approximate string matching |w (DE-604)BV045558855 |
856 | 4 | 1 | |u https://refubium.fu-berlin.de/handle/fub188/24413 |x Resolving-System |z kostenfrei |3 Volltext |
999 | |a oai:aleph.bib-bvb.de:BVB01-030942715 |
Datensatz im Suchindex
_version_ | 1804179539576750080 |
---|---|
any_adam_object | |
author | Pockrandt, Christopher Maximilian |
author_GND | (DE-588)1183627742 |
author_facet | Pockrandt, Christopher Maximilian |
author_role | aut |
author_sort | Pockrandt, Christopher Maximilian |
author_variant | c m p cm cmp |
building | Verbundindex |
bvnumber | BV045558901 |
ctrlnum | (DE-599)BVBBV045558901 |
format | Thesis Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01271nam a2200361 c 4500</leader><controlfield tag="001">BV045558901</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20190509 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">190415s2019 a||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV045558901</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-188</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">000</subfield><subfield code="2">FUB</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Pockrandt, Christopher Maximilian</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1183627742</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Approximate string matching</subfield><subfield code="b">improving data structures and algorithms</subfield><subfield code="c">vorgelegt von Christopher Maximilian Pockrandt</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="c">2019</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">175 Seiten</subfield><subfield code="b">Illustrationen</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="502" ind1=" " ind2=" "><subfield code="b">Dissertation</subfield><subfield code="c">Freie Universität Berlin</subfield><subfield code="d">2019</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">approximate</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">fm index</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">string matching</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">search</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">epr dictionaries</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">BWT</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="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="a">Pockrandt, Christopher Maximilian</subfield><subfield code="t">Approximate string matching</subfield><subfield code="w">(DE-604)BV045558855</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://refubium.fu-berlin.de/handle/fub188/24413</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030942715</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV045558901 |
illustrated | Illustrated |
indexdate | 2024-07-10T08:21:29Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030942715 |
open_access_boolean | 1 |
owner | DE-188 |
owner_facet | DE-188 |
physical | 175 Seiten Illustrationen |
publishDate | 2019 |
publishDateSearch | 2019 |
publishDateSort | 2019 |
record_format | marc |
spelling | Pockrandt, Christopher Maximilian Verfasser (DE-588)1183627742 aut Approximate string matching improving data structures and algorithms vorgelegt von Christopher Maximilian Pockrandt Berlin 2019 175 Seiten Illustrationen txt rdacontent n rdamedia nc rdacarrier Dissertation Freie Universität Berlin 2019 approximate fm index string matching search epr dictionaries BWT (DE-588)4113937-9 Hochschulschrift gnd-content Erscheint auch als Online-Ausgabe Pockrandt, Christopher Maximilian Approximate string matching (DE-604)BV045558855 https://refubium.fu-berlin.de/handle/fub188/24413 Resolving-System kostenfrei Volltext |
spellingShingle | Pockrandt, Christopher Maximilian Approximate string matching improving data structures and algorithms approximate fm index string matching search epr dictionaries BWT |
subject_GND | (DE-588)4113937-9 |
title | Approximate string matching improving data structures and algorithms |
title_auth | Approximate string matching improving data structures and algorithms |
title_exact_search | Approximate string matching improving data structures and algorithms |
title_full | Approximate string matching improving data structures and algorithms vorgelegt von Christopher Maximilian Pockrandt |
title_fullStr | Approximate string matching improving data structures and algorithms vorgelegt von Christopher Maximilian Pockrandt |
title_full_unstemmed | Approximate string matching improving data structures and algorithms vorgelegt von Christopher Maximilian Pockrandt |
title_short | Approximate string matching |
title_sort | approximate string matching improving data structures and algorithms |
title_sub | improving data structures and algorithms |
topic | approximate fm index string matching search epr dictionaries BWT |
topic_facet | approximate fm index string matching search epr dictionaries BWT Hochschulschrift |
url | https://refubium.fu-berlin.de/handle/fub188/24413 |
work_keys_str_mv | AT pockrandtchristophermaximilian approximatestringmatchingimprovingdatastructuresandalgorithms |