Popping Superbubbles and identifying clumps
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:
- 21 31 00272
INESC-ID ESR Talks – February 2023
If you are a masters/PhD student or a postdoctoral fellow, come and present your work in an informal and friendly environment – and savour some tasty snacks!
Individual talks will be 10-15 minutes plus time for feedback. Enroll on your selected date by emailing pedro.ferreira[at]inesc-id.pt.
Happening on the second Wednesday of every month (4pm-5pm):
- 15 February (Alves Redol, Room 9)
- 15 March (Alves Redol, Room 9)
- 12 April (Alves Redol, Room 9)
- 10 May (Alves Redol, Room 9)
- 14 June (Alves Redol, Room 9)
- 12 July (Alves Redol, Room 9)
We hope to see you there!