Mathematics Biology Seminar
12:00pm - 1:00pm, Wednesday, April 16, 2025
MSB 318
Speaker:
Dr. Ahsan Sanaullah
Department of Computer Science
University of Central Florida
Title: Efficient Algorithms and Data Structures for Identity by Descent Segment Detection
Abstract: In this talk, we cover two main topics. First, we discuss the Dynamic mu-PBWT, then the TS-PBWT. Both are related to the Positional Burrows-Wheeler Transform (PBWT), a data structure for the efficient haplotype matching and storage for large collections of haplotypes. The Dynamic mu-PBWT is a variation of the PBWT that allows efficient insertion and deletion of haplotypes while maintaining efficient querying capabilities in compressed space. The TS-PBWT is an algorithm that finds Identity by Descent segments in an Ancestral Recombination Graph using the PBWT. The Ancestral Recombination Graph is represented as a tree sequence, therefore the algorithm is called the Tree Sequence PBWT (TS-PBWT). We also discuss different definitions of Identity by Descent segments. Both the Dynamic mu-PBWT and the TS-PBWT will allow the analysis of haplotype matches and IBD segment detection in larger haplotype datasets enabling more powerful population genetics analyses.
Read More