Book contents
- Frontmatter
- Dedication
- Contents
- List of insights
- Preface
- Notation
- Part I Preliminaries
- 1 Molecular biology and high-throughput sequencing
- 2 Algorithm design
- 3 Data structures
- 4 Graphs
- 5 Network flows
- Part II Fundamentals of Biological Sequence Analysis
- Part III Genome-Scale Index Structures
- Part IV Genome-Scale Algorithms
- Part V Applications
- References
- Index
5 - Network flows
from Part I - Preliminaries
Published online by Cambridge University Press: 28 September 2023
Book contents
- Frontmatter
- Dedication
- Contents
- List of insights
- Preface
- Notation
- Part I Preliminaries
- 1 Molecular biology and high-throughput sequencing
- 2 Algorithm design
- 3 Data structures
- 4 Graphs
- 5 Network flows
- Part II Fundamentals of Biological Sequence Analysis
- Part III Genome-Scale Index Structures
- Part IV Genome-Scale Algorithms
- Part V Applications
- References
- Index
Summary
In this chapter we show that many optimization problems can be reduced to a network flow problem. This polynomially solvable problem is a powerful model, which has found a remarkable array of applications. Roughly stated, in a network flow problem, one is given a transportation network and is required to find the optimal way of sending some content through this network. The chapter covers basic primitives around a general flow formulation called the minimum-cost flow.
- Type
- Chapter
- Information
- Genome-Scale Algorithm DesignBioinformatics in the Era of High-Throughput Sequencing, pp. 53 - 80Publisher: Cambridge University PressPrint publication year: 2023