Campus Event Calendar
Event Entry
What and Who
Computing the average Filtration Efficiency of Shape-Index Filters
Marc Fontaine
Fachrichtung Informatik - Saarbrücken
AG1 Mittagsseminar (own work)
AG 1, AG 2, AG 3
MPI Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Wednesday, 18 June 2003
16:00
60 Minutes
46.1 - MPII
024
Saarbrücken
Abstract
In this talk I'll give a summary of what is going to be my diploma thesis.
I'll present a new and easy to understand algorithm for
computing the average filtration efficiency of shape-index filters.
Indexed filters that use q-grams and,in particular, gaped q-grams or
shapes, are a state of the art tool for approximate string matching.
They have many applications, for example in bio-informatics for
searching big DNA-databases.
Contact
Marc Fontaine
--email hidden
passcode not visible
logged in users only
Tags, Category, Keywords and additional notes
approximate string matching; index; filter; shape; gaped q-grams; BDD