11 citations · 26 across the 6 of their papers we have counts for
4 papers · 1 filter
A Safety Framework for Flow Decomposition Problems via Integer Linear Programming
Fernando H. C. Dias, Manuel Caceres, Lucia Williams +2
Many important problems in Bioinformatics (e.g., assembly or multi-assembly) admit multiple solutions, while the final objective is to report only one. A common approach to deal wi…
Minimum Flow Decomposition in Graphs with Cycles using Integer Linear Programming
Fernando H. C. Dias, Lucia Williams, Brendan Mumey +1
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 Sci…
Width Helps and Hinders Splitting Flows
Manuel Cáceres, Massimo Cairo, Andreas Grigorjew +5
Minimum flow decomposition (MFD) is the NP-hard problem of finding a smallest decomposition of a network flow/circulation on a directed graph into weighted source-to-sink p…
Safety and Completeness in Flow Decompositions for RNA Assembly
Shahbaz Khan, Milla Kortelainen, Manuel Cáceres +2
Decomposing a network flow into weighted paths has numerous applications. Some applications require any decomposition that is optimal w.r.t. some property such as number of paths,…