Spring Semester 2002/2003
Graduate Course, Computer Science Department Tel-Aviv University.
TA: Max Shatsky
Lectures and assignments:
Lecture 1 Assignment 1
Lecture 2 TA 2 Assignment 2
Lecture 3 Assignment 3
Lecture 4a Lecture 4b
Lecture 5 Assignment 4
Quadratic Shape Descriptors (QSD)
Largest Common Subtrees and Largest Common Point Sets
1.Wolfson, H. J., Generalizing the Generalized Hough Transform, Pattern Recognition Letters, vol. 12(9), pp. 565 - 573, (1991).
2. G. Verbitsky, R. Nussinov, H.J. Wolfson, Structural Comparison Allowing Hinge Bending, Swiveling Motions, PROTEINS, 34, 232-254, (1999)
Since proteins are 3-dimensional geometric objects, efficient algorithms which handle such objects can be of great benefit for the solution of these 'real-life' problems. In this sense there is much in common to the problems occurring in protein analysis and drug design with central problems in Computer Vision or Computational Geometry. The course will highlight these ideas and concentrate on algorithms which originated in Computer Vision/Computational Geometry research. Special emphasis will be given to the practical solution of the problems at hand.
We shall shortly introduce some basic knowledge on 3-D protein structure (for Computer Science students) and present state-of-the-art geometric algorithms which tackle the above mentioned problems. Many of the algorithms, which will be presented at the course, were developed at Tel Aviv University by the Computational Structural Biology group under the supervision of Prof. Ruth Nussinov from the Molecular Medicine Institute and Prof. Haim Wolfson from the Computer Science Department.
mathematical and computational maturity. No knowledge of Molecular Biology is assumed.