|
 |
 |
 |
A fool's brain digests philosophy into folly, science into superstition,
and art into pedantry. Hence University education. (George Bernard
Shaw)
| |
 |
 |
|
This place contains some stuff from my work at university. Unfortunately,
most the stuff is in german, except for the SCUBA paper and my diploma (masters) thesis.
|
 Diploma / Masters Thesis: Distributed data structures for
efficient molecular sequence analysis
| Archive | Size | Version | Description |
| ptpan-thesis |
[PS.gz]
[PDF] |
451 KB
1092 KB |
15-Nov-03 |
Abstract:
With the increasing demands on fast query algorithms and data structures on huge genome
databases, many of the old indexing techniques become unsuitable. In this thesis, we will
propose and implement a novel indexing structure based on suffix trees called PTPan.
Its main purpose is the fast lookup of DNA/RNA substrings in very large databases.
Creation and use of this structure can be easily distributed and parallelised across multiple
machines on a cluster. The index is supposed to fit in main memory. References to the
source database are not necessary for generating a candidate set. Compression is used to
keep the requirements on disk as small as possible, without heavily affecting the O(|Q|)
lookup time (Q being the query string). Space requirements after compression are better
or close to those of suffix arrays (using suitable parameters for our application). PTPan
has been implemented into the ARB software package. |
|
Project in software development (SEP), SCUBA
| Archive | Size | Version | Description |
| scuba |
[PS.gz]
[PDF] |
404 KB
608 KB |
04-Apr-03 |
Abstract: Using multiple intervals on space filling curves has a benefit to merely
approximating the polygon by a bounding box for indexing purposes. These
intervals feature a shapes closer to those of arbitrary, non rectangular
polygons. In this paper we examine whether SCUBA (Space filling Curves
versus Unsophisticated Bounding box Approximation) is a feasible approach
in comparison to a simple bounding box index, and how to find a reasonable
break even point between space usage and access time. |
|
 Hauptseminar Betriebssysteme SS2000, Exokernel
| Archive | Size | Version | Description |
| Exokernel |
[PS.gz]
[DVI]
[TEX] |
127 KB
59 KB
34 KB |
18-May-00 |
Das 18-seitige Handout |
| ExoFoils |
[PS.gz]
[DVI]
[TEX] |
95 KB
18 KB
11 KB |
18-May-00 |
Die 25 Schwarz/Weiß-Folien des Vortrags |
| ExoSeminar.zip |
343 KB |
18-May-00 |
Alles zusammen in einem Archiv (inkl. Beispiele, Grafiken, Farbfolien) |
|
Übungsmaterial Informatik 3
| Archive | Size | Version | Description |
| AdrArt |
[PS.gz]
[DVI]
[TEX] |
43 KB
17 KB
15 KB |
18-Dec-00 |
Merkblatt zu den Adressierungsarten der MI sowie zu den Unterprogrammtechniken mit vielen Beispielen |
| I3Klausur |
[PS.gz]
[DVI] |
27 KB
9 KB |
23-Jan-02 |
(nicht ganz fertige) Übungsklausur Informatik 3 mit 5 Aufgaben |
| I3Loesung |
[PS.gz]
[DVI] |
49 KB
16 KB |
28-Jan-02 |
Musterlösung zur Übungsklausur |
|
Proseminar UNIX-Tools SS99, LaTeX Vortrag
| Archive | Size | Version | Description |
| LaTeXFoils |
[PS.gz]
[DVI]
[TEX] |
237 KB
23 KB
15 KB |
27-Jul-99 |
Die 23 Folien für den Vortrag |
| LaTeXHandout |
[PS.gz]
[DVI]
[TEX] |
25 KB
4 KB
3 KB |
27-Jul-99 |
Merkblatt für die Seminarteilnehmer |
| LaTeXUebung |
[PS.gz]
[DVI]
[TEX] |
21 KB
3 KB
2 KB |
27-Jul-99 |
Übungsblatt für die Seminarteilnehmer |
| LaTeXSeminar.zip |
368 KB |
27-Jul-99 |
Alles zusammen in einem Archiv (inkl. Beispiele) |
|
©1997-2009 Chris Hodges. Last time updated on 01-Jan-08 22:35:02. Legal disclaimer, imprint.
|
