Flow Decomposition Algorithms for Multiassembly Problems
- Wednesday, October 6, 2021 from 10:00am to 11:00am
- Zoom: https://zoom.us/j/7736002365?pwd=NldjbnlQMUx4ZXZFYkp2SFFJeTk5QT09
Current genetic sequencing technologies allow for fast and cheap measurement of short substrings of genetic sequences called reads which must be assembled to recover the full unknown sequence. In some cases, such as when assembling RNA transcripts or the genomes of a mixture of species taken in a single sample, the reads come from multiple sequences. In this case, we would like to recover all the distinct unknown sequences and their relative abundances, and we call this multiassembly. A common model underlying many multiassembly approaches is flow decomposition. This talk will explore several recent algorithmic and practical flow decomposition based approaches.
- Gianforte School of Computing