University of Cambridge > > Information Theory Seminar > Pooled testing and information theory

Pooled testing and information theory

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

  • UserDr Matthew Aldridge, University of Leeds World_link
  • ClockMonday 22 May 2023, 14:00-15:00
  • HouseMR5, CMS Pavilion A.

If you have a question about this talk, please contact Prof. Ramji Venkataramanan.

This talk has been canceled/deleted

When testing many people for a disease, the traditional method is “individual testing”: a sample (of, perhaps, blood or saliva) is taken from each person, and each sample is analysed to see if it contains the antigen. People who get a positive test have the disease, and people who get a negative test do not have the disease. An alternative is “pooled testing”: we take samples from a few people, mix those samples together in the same test tube, and perform a single test on this mixed sample. If the test on this pooled sample comes back negative, none of the people have the disease; if the test comes back positive, we know that at least one of the people has the disease, but further tests are required to work out which. In some circumstances, pooled testing can find which people have the disease using many fewer tests than with individual testing.

Analysis of pooled testing has often profited from using information theoretic techniques – we will look at two examples in this talk. First, we will see how the analysis of a rare disease with parallel processing of tests is very similar to the classical information theory problem of channel capacity – but has some important differences too. Second, we see how the analysis of a more common disease with serial processing of tests relates to the problem of finding optimal source codes for infinite alphabets.

This talk is part of the Information Theory Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.


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