Decomposing Flow Networks for DNA Sequencing

Document Type

Presentation Abstract

Presentation Date

4-15-2024

Abstract

Finding a maximum flow through network is a classical problem in computer science, celebrated for its deep theoretical properties and diverse applications. In this talk, we shift focus to a less explored but related problem: the decomposition of a network flow into weighted paths. We will see that this problem also has many interesting theoretical properties and practical applications, focusing especially on its usefulness in assembling genomes.

Additional Details

April 15, 2024 at 3:00 p.m. Math 103

This document is currently not available here.

Share

COinS