Fakultät für Informatik - TU MünchenLehrstuhl für Effiziente Algorithmen |
Forschung
- Bioinformatik
- Netzwerk Analyse
- Graph Drawing
Projekte
Aktuelles
xAnVi
[ mehr ... ]
PAST
[ mehr ... ]
Lehre
Archiv
- Praktikum "Algorithmen Entwurf" (WS 04/05) (WS 05/06)
- Praktikum "Diskrete Optimimierung" (SS 2004) (SS 2005)
- Proseminar Graph Drawing (SS 2004)
- Übung zur Vorlesung "Grundlegende Algorithmen" (WS 03/04)
- Übung zur Vorlesung "Effiziente Algorithmen II" (SS 03)
Betreute Arbeiten
- W. Koska: "A hierarchical graph implementation." (SEP, 10/2006)
- C. Mei-Chuan: "2-Dimensional Pattern Matching" (Proseminar, 1/2005)
- T. Binder: "Centrality-based Analysis of Metabolic Networks" (Dipl. Arbeit, 9/2004)
- P. Pissang: "Information Content of Genes" (Proseminar,12/2003)
- S. Strempel: "Sequence Assembly: Shotgun Sequencing" (Proseminar, 1/2003)
Publikationen & Präsentationen
xAnVi - An Extensible Visualization and Analysis Framework
July 2006
Information Visualization 2006 , vol., no.pp. 45- 52, 05-07 July 2006
PAST: Fast Structure-based Searching in the PDB
July 2006
Nucleic Acids Research; 2006 Jul 1; 34:W20-23 (Web Server issue)
All-Pairs Common-Ancestor Problems in Weighted Dags.
April 2006
Technical Report TUM-I0606, Technische Universität München, Institut für Informatik
Analysis of Support Vector Regression for Approximation of Complex Engineering Analyses
July 2005
ASME, Journal of Mechanical Design, July 2005, MD-03-1319
A Method for Fast Approximate Searching of Polypeptide Structures in the PDB
Proceedings of the German Conference on Bioinformatics (GCB'04)
(October 4-6 2004, Bielefeld / Germany).
Lecture Notes in Informatics (LNI) Vol. P-53, pp. 65-74.
A Fast Method for Motif Detection and Searching in a Protein Structure Database
Proceedings of the German Conference on Bioinformatics (GCB'03)
(October 12-14 2003, Munich / Germany).
Vol. II (Poster abstracts), pp. 186-188.
Analysis of Support Vector Regression for Approximation of complex Engineering Analyses
ASME Design Engineering Technical Conferences - Design Automation Conference, Shimada, K., ed.
(September 2-6, 2003, Chicago, IL
paper no. DETC2003/DAC-48759
A Fast Algorithm for the Iterative Calculation of Betweeness Centrality
Proceedings of the German Conference on Bioinformatics (GCB'04)
(October 04-06 2004, Bielefeld)
Discovery Notes and Poster Abstracts, p. 114-115