Safety of Flow Decompositions in DAGs

02/12/2021
by   Shahbaz Khan, et al.
0

Network flows are one of the most studied combinatorial optimization problems with innumerable applications. Any flow on a directed acyclic graph (DAG) G having n vertices and m edges can be decomposed into a set of O(m) paths, with applications from network routing to assembly of biological sequences. In some applications, the flow decomposition corresponds to some particular data that need to be reconstructed from the flow, which require finding paths (or subpaths) appearing in all possible flow decompositions, referred to as safe paths. Recently, Ma et al. [WABI 2020] addressed a related problem in a probabilistic framework. Later, they gave a quadratic-time algorithm based on a global criterion, for a generalized version (AND-Quant) of the corresponding problem, i.e., reporting if a given flow path is safe. Our contributions are as follows: 1- A simple characterization for the safety of a given path based on a local criterion, which can be directly adapted to give an optimal linear time verification algorithm. 2- A simple enumeration algorithm that reports all maximal safe paths on a flow network in O(mn) time. The algorithm reports all safe paths using a compact representation of the solution (called P_c), which is Ω(mn) in the worst case, but merely O(m+n) in the best case. 3- An improved enumeration algorithm where all safe paths ending at every vertex are represented as funnels using O(n^2+| P_c|) space. These can be computed and used to report all maximal safe paths, using time linear in the total space required by funnels, with an extra logarithmic factor. Overall we present a simple characterization for the problem leading to an optimal verification algorithm and a simple enumeration algorithm. The enumeration algorithm is improved using the funnel structures for safe paths, which may be of independent interest.

READ FULL TEXT

page 1

page 3

page 4

page 6

page 7

page 11

page 15

research
01/25/2022

Safety and Completeness in Flow Decompositions for RNA Assembly

Decomposing a network flow into weighted paths has numerous applications...
research
02/24/2020

From omnitigs to macrotigs: a linear-time algorithm for safe walks – common to all closed arc-coverings of a directed graph

A partial solution to a problem is called safe if it appears in all solu...
research
01/30/2023

A Safety Framework for Flow Decomposition Problems via Integer Linear Programming

Many important problems in Bioinformatics (e.g., assembly or multi-assem...
research
07/09/2020

Safety in s-t Paths, Trails and Walks

Given a directed graph G and a pair of nodes s and t, an s-t bridge of G...
research
10/14/2022

Cut paths and their remainder structure, with applications

In a strongly connected graph G = (V,E), a cut arc (also called strong b...
research
10/15/2021

From river flow to spatial flow: flow map via river flow directions assignment algorithm

Flow map is an effective way to visualize object movements across space ...
research
05/14/2018

Assembling Omnitigs using Hidden-Order de Bruijn Graphs

De novo DNA assembly is a fundamental task in Bioinformatics, and findin...

Please sign up or login with your details

Forgot password? Click here to reset