University of Cambridge > Talks.cam > Computational and Systems Biology Seminar Series 2022 - 23 > Mapping DNA replication stress in parasites and cancer cells with long-read sequencing and AI

Mapping DNA replication stress in parasites and cancer cells with long-read sequencing and AI

Add to your list(s) Download to your calendar using vCal

  • UserDr. Michael A. Boemo, Research Group Leader, Department of Pathology
  • ClockWednesday 15 February 2023, 14:00-15:00
  • HouseCMS, Meeting Room 15.

If you have a question about this talk, please contact Samantha Noel.

Our intention is to deliver all Seminars in person. Seminars are aimed mainly at MPhil CompBio students, but are open to anyone who wishes to attend by pre-booking with the Administrator

Every time a cell divides, it must copy (or “replicate”) its genome exactly once, which it achieves through the parallel action of thousands of replication forks. One of the most serious errors in DNA replication occurs when replication forks stall, which happens when the fork encounters an obstacle that it cannot pass. The frequent slowing or stalling of replication forks, termed “replication stress”, is rare in healthy human cells but common in both cancer cells and parasites. Replication stress is therefore a common therapeutic target for anti-malarial and cancer chemotherapies, but we have a relatively poor understanding of where, when, why, and how often replication forks stall under these therapies. I will discuss our recent progress towards answering these questions, whereby we are using long-read nanopore DNA sequencing together with AI to measure the movement and stress of thousands of replication forks across the genomes of human cancer cells and the malaria parasite Plasmodium falciparum.

This talk is part of the Computational and Systems Biology Seminar Series 2022 - 23 series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2023 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity