Click on a theme or a project in the table below for more information.
Subproject AFM2.1: Combinatorial Algorithms in Bio-informatics
Subproject leader
Dr. L. Stougie (TU/e/CWI)
Research description
The general goal of this research project is algorithmic support
for research in life sciences. By the nature of the research group
we concentrate on algorithms for problems appearing in life
sciences that are of a combinatorial nature. The past has already
shown that opportunities in this direction are abundant.
The project concentrates on algorithms and models for the tasks to
analyze relations, functions, and applications of the genomic
material. Examples of such computational biological problems are:
molecular conformation relying only upon relatively few pair-wise
distance measurements (a continuous optimization problem where also
topics from combinatorics and computer science are applicable);
prediction of folding of a protein and of the stability of such
folding (a global optimization problem-badly folded proteins may
cause diseases like Kreutzfeld-Jacob); construction of evolutionary
trees for collections of species and of DNA-maps; analysis of
mass-spectrometry data; detection of minimum test sets. Books
covering some of those topics show clearly that only few problems,
usually over-stylized versions of the real-life problems, have been
solved satisfactorily. As a result, software emerging from this
research has its limitations and drawbacks, as pointed out already
by members of our group. A lot of work in this field has remained
open and is asking for improvements.
Associate partners
AFM2.1 Researchers funded by BRICKS
- Dr. L. Stougie (TU/e/CWI)
- Dr. J. Keijsper (TU/e)
- Dr.ir. C.A.J. Hurkes (TU/e)
- Dr. M. v.d. Wiel (TU/e)
- Dr. J.T. Tromp (CWI)
- Dr. S. Kelk (CWI)
- Ir. L. van Iersel (TU/e)
For more information, please refer to the publications and posters of this project.
|
