Title: Approximation Algorithms for Steiner Tree Problems with applications in Computational Biology

About the Talk:
Dive into the world of Steiner Tree Problems (STP) – a classical NP-hard combinatorial optimisation problem with applications in computational biology and network wiring. This is a self-contained talk and will begin with highlighting the complexity of this problem and its structure in comparison with the easier Minimum Spanning Tree problem (MST). The crux of the talk will focus on the development and analysis of approximation algorithms and heuristics for Tree Alignment.

About the Speaker:
Dr Srikrishnan Divakaran is a Theoretical Computer Scientist with extensive experience in education, research, and industry. With a PhD from Rutgers University and a career spanning over 25 years, he brings a wealth of knowledge in fields such as Computational Biology/Bioinformatics, Combinatorial Optimisation, and Data Science.