… in the form of subpath constraints. These are … flow decomposition; thus, we are looking for
flow decompositions with the property that every constraint is a subpath of some decomposition …

… These constraints allow one to incorporate longer, known … subpath constraint set is a
subpath in the flow decomposition (… a flow decomposition under a set of subpath constraints is …

… However, subpath constraints have never been considered … subwalk constraints, which are
subpath constraints that can … flow walk in any flow decomposition with subwalk constraints, …

… subpaths, or pairs of subpaths, of the graph have to be entirely covered by some path in the
MPC. We show that in the case of long reads (subpaths), … ; any decomposition of this flow into …

… Thus, its main limitation is that it does not hold for inter-procedural control-… segment (subpath)
of our path decomposition. Finally, our construction starts with a path decomposition of …

In this paper we show that, given a graph and parameters 6 and r, we can find either a K,,.
minor or an edge-cut of size O (mT/6) whose removal yields components of weak diameter O (…

… yields solutions that approach the accuracy of a minimum decomposition without subpath
constraints; thus, our results show that heuristic FDSC is a practical substitute for minimum FD …

… a set of paths (subpath constraints) that must appear in at … a subpath of some P i in the
decomposition. To represent this behavior in the ILP formulation, we add the following constraints …

… constraint equations may grow exponentially, making the optimization problem more intractable.
The decomposition … node uk is selected to decompose the path +/(uk) into two subpaths, …

… inside state-of-the-art RNA assemblers can be easily modeled on top of our basic ILP (ie,
subpath constraints, inexact, and imperfect flows). Further flexibility also comes from the fact …