Campus Event Calendar
Event Entry
What and Who
Approximate Search in DNA Databases
Stefan Burkhardt
Max-Planck-Institut für Informatik, Saarbrücken, Germany
Seminar des Graduiertenkollegs
AG 1, AG 2
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 8 June 98
16:00
60 Minutes
45
016
Saarbrücken
Abstract
In my talk i will present an algorithm for approximate string
matching designed for DNA-databases. The search for similar sequences
in such databases is vital for researchers in the field of genetics
and biology. I am currently working on an efficient implementation
of this algorithm and i will display first results and compare
them with the methods currently used.
Contact
Stefan Burkhardt
+49+681+9325 121
--email hidden
passcode not visible
logged in users only
Tags, Category, Keywords and additional notes
database approximate search DNA