Modern RNA-sequencing (RNA-seq) protocols can produce multi-end data, where multiple
reads originating from the same transcript are attached to the same barcode. The long-range …

Flow decomposition has numerous applications, ranging from networking to bioinformatics.
Some applications require any valid decomposition that optimizes some property as number …

A multi-assembly problem asks to reconstruct multiple genomic sequences from mixed
reads sequenced from all of them. Standard formulations of such problems model a solution …

Presenting the fundamental algorithms and data structures that power bioinformatics
workflows, this book covers a range of topics from the foundations of sequence analysis …

Minimum flow decomposition (MFD)--the problem of finding a minimum set of weighted
source-to-sink paths that perfectly decomposes a flow--is a classical problem in Computer …

Motivation Many important problems in Bioinformatics (eg assembly or multiassembly) admit
multiple solutions, while the final objective is to report only one. A common approach to deal …

A decomposition of a network flow is a set of weighted walks whose superposition equals
the flow. In this article, we give a simple and linear-time-verifiable complete characterization …

Decomposing a network flow into weighted paths is a problem with numerous applications,
ranging from networking, transportation planning, to bioinformatics. In some applications we …

Minimum flow decomposition (MFD) is an NP-hard problem asking to decompose a network
flow into a minimum set of paths (together with associated weights). Variants of it are …

Minimum flow decomposition (MFD) is a common problem across various fields of Computer
Science, where a flow is decomposed into a minimum set of weighted paths. However, in …