11 citations · 26 across the 6 of their papers we have counts for
9 papers
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,…
Fast, Flexible, and Exact Minimum Flow Decompositions via ILP
Fernando H. C. Dias, Lucia Williams, Brendan Mumey +1
Minimum flow decomposition (MFD) (the problem of finding a minimum set of paths that perfectly decomposes a flow) is a classical problem in Computer Science, and variants of it are…
A Faithful Discretization of Verbose Directional Transforms
Brittany Terese Fasy, Samuel Micka, David L. Millman +2
The persistent homology transform, Betti function transform, and Euler characteristic transform represent a shape with a multiset of persistence diagrams, Betti functions, or Euler…
Reconstructing Embedded Graphs from Persistence Diagrams
Robin Lynne Belton, Brittany Terese Fasy, Rostik Mertz +6
The persistence diagram (PD) is an increasingly popular topological descriptor. By encoding the size and prominence of topological features at varying scales, the PD provides impor…
Challenges in Reconstructing Shapes from Euler Characteristic Curves
Brittany Terese Fasy, Samuel Micka, David L. Millman +2
Shape recognition and classification is a problem with a wide variety of applications. Several recent works have demonstrated that topological descriptors can be used as summaries…
Learning Simplicial Complexes from Persistence Diagrams
Robin Lynne Belton, Brittany Terese Fasy, Rostik Mertz +6
Topological Data Analysis (TDA) studies the shape of data. A common topological descriptor is the persistence diagram, which encodes topological features in a topological space at…