Computational Biology
The modern biology researcher faces vast amounts of data produced by high-throughput analytical technologies for DNA, RNA, and proteins.
This rich and complex mix of data is also confounded by a variety of biological and nonbiological factors, which makes it difficult, inefficient, and inaccurate to draw the right research conclusions.
By understanding and exploiting properties of the underlying biology, instruments, technologies, and experiment designs, we develop advanced methods to process and analyse these large amounts of complex, biological data – which help solve problems in biology, biotechnology, and medicine.
What We Do
Develop effective and efficient algorithmic techniques used in the acquisition, storage, analysis, and dissemination of biological data.
Design innovative and elegant computational approaches to decipher the structure, function, and behaviour of cells, and explore how changes in these affect phenotypes.
Sub Areas
- Bioinformatics Algorithms
- Omics Data Analysis
- Learning Theory
- Machine Learning
Our Research Projects
Protein folding and protein structure prediction
Deciphering the structure and function of proteins is pivotal in modern biology and medicine. Our work focuses on pioneering computational methods, integrating advanced AI techniques and physics-based force fields, to precisely model protein structure and function. A key objective is uncovering the fundamental interplay between protein sequence, structure, and function.
- Bioinformatics Algorithms
AI-based protein design and drug discovery
Nature proteins exhibit limited structural folds and functions, shaped over billions of years of evolution. This project seeks to leverage AI and deep learning to craft novel protein sequences, surpassing natural constraints. The computationally designed proteins and peptides hold promise as drugs, offering innovative treatments for diverse human diseases, including cancer and Alzheimer's.
- Bioinformatics Algorithms
From iteration on multiple collections in synchrony to fast general interval joins
Synchrony iterator captures a programming pattern for synchronized iterations. It is a conservative extension that enhances the repertoire of algorithms expressible in comprehension syntax. In particular, efficient general synchronized iterations, e.g. linear-time algorithms for low-selectivity database non-equijoins, become expressible naturally in comprehensinon syntax.
- TRL 4