Welcome

Research and teaching @ TUHH

Thursday, January 27, 2011

Introduction to Bioinformatics - Lecture 13

Today, statistical sampling methods were considered. Here are the topics:
  • Statistical mechanics,
  • canonical and micro-canonical ensemble,
  • observables and partition function,
  • molecular dynamics simulations (verlet and velocity verlet algorithm),
  • consideration of time step,
  • improvement of simulation (cutoff, distance, and multipole schemes),
  • standard Monte Carlo method,
  • calculation of partition function,
  • importance sampling,
  • sampling of protein structures.

Friday, January 21, 2011

Discrete Mathematics I - Lecture 12

Heutige Themen:
  • Hauptsatz der Arithmetik,
  • Restklassenringe modulo Z bzw. Q[x].

Computational Biology - Lecture 12

Yesterday, we resumed with the introduction into algebraic geometry:
  • ideal-variety correspondence,
  • elimination theorem,
  • extension theorem.

Thursday, January 20, 2011

Introduction to Bioinformatics - Lecture 12

Today, we will give an introduction to 3D structure prediction of proteins:
  • Force fields (CHARMM, Oobatake-Crippen),
  • rigid geometry models,
  • buildup method,
  • basic heuristic methods,
  • conformational space annealing,
  • HP model.

Friday, January 14, 2011

Discrete Mathematics I - Lecture 11

Kurze Einführung in die Teilbarkeitslehre (Ring der ganzen Zahlen, Polynomring):
  • Division mit Rest
  • ggT und kgV
  • Euklidischer Algorithmus
  • Satz von Bezout, erweiterter Euklidischer Algorithmus.
In der Vorlesung gab es Fragen nach der Definition des ggT, d.h., gemeinsamer Teiler und größter unter allen gemeinsamen Teilern. Mathematisch handelt es sich um das Infimum der beteiligten Zahlen. Die gemeinsamen Teiler bilden die unteren Schranken und das Infimum ist die größte untere Schranke. Für das kgV gilt die duale Aussage.

    Thursday, January 13, 2011

    Computational Biology - Lecture 11

    Today, we will give an introduction to affine algebraic sets:
    • Hilbert's Nullstellensatz (weak and strong version),
    • correspondence between affine algebraic sets and ideals.

    Introduction to Bioinformatics - Lecture 11

    Today, we finished the considerations about 2D structure prediction:
    • Nearest neighbor classification (intrinsic dimension, Bhattacharyya distance).
    • Consensus prediction
    • Neural network classification (Rost-Sander approach).