Ritu Kundu,

Kings College


The information that can be inferred or predicted from knowing the genomic sequence of an organism is astonishing. String algorithms are critical to this process. This talk provides an overview of two particular problems
– Superbubbles (an important subgraph class for analysing assembly graphs) and Clustered-clumps (a maximal overlapping set of occurrences of a given set of patterns) – that arise during computational molecular biology research, and recent algorithmic developments in solving them.




Date: 2016-Jun-28     Time: 14:30:00     Room: 408

For more information: