Filter Algorithms for Approximate String Matching

Burkhardt, Stefan

doi:10.22028/D291-25685

Local TagsRelease HistoryDetailsSummary

Filter Algorithms for Approximate String Matching

Burkhardt, S. (2002). Filter Algorithms for Approximate String Matching. PhD Thesis, Universität des Saarlandes, Saarbrücken.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2F8D-B Version Permalink: https://hdl.handle.net/21.11116/0000-000C-4815-C

Genre: Thesis

Files

show Files

Locators

show

hide

Locator:
http://scidok.sulb.uni-saarland.de/volltexte/2004/171/ (Any fulltext) Open Access Green

Description:
-

OA-Status:
Green

Locator:
http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de (Copyright transfer agreement) Open Access status unknown

Description:
-

OA-Status:
Not specified

Creators

show

hide

Creators:
Burkhardt, Stefan^{1, 2}, Author
Lenhof, Hans-Peter¹, Advisor
Ukkonen, Esko³, Referee

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019
2International Max Planck Research School, MPI for Informatics, Max Planck Society, Campus E1 4, 66123 Saarbrücken, DE, ou_1116551
3External Organizations, ou_persistent22

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2003-09-08Accepted: 2002-01-01Date issued: 2002

Publication Status: Issued

Pages: -

Publishing info: Saarbrücken : Universität des Saarlandes

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 202112
Other: Local-ID: C1256428004B93B8-50A5629F91EEAE1AC1256C94004FEB00-BurkhardtDiss02
DOI: 10.22028/D291-25685
URN: urn:nbn:de:bsz:291-scidok-1712
Other: hdl:20.500.11880/25741

Degree: PhD

Event

show

Legal Case

show

Project information

show

Source

show