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...
share
research
∙
12/26/2022
Efficient Graph Reconstruction and Representation Using Augmented Persistence Diagrams
Persistent homology is a tool that can be employed to summarize the shap...
research
∙
08/31/2022
Minimum Flow Decomposition in Graphs with Cycles using Integer Linear Programming
Minimum flow decomposition (MFD) – the problem of finding a minimum set ...
research
∙
07/05/2022
Width Helps and Hinders Splitting Flows
Minimum flow decomposition (MFD) is the NP-hard problem of finding a sma...
research
∙
01/25/2022
Safety and Completeness in Flow Decompositions for RNA Assembly
Decomposing a network flow into weighted paths has numerous applications...
research
∙
12/29/2019
Persistence Diagrams for Efficient Simplicial Complex Reconstruction
Topological descriptors have been shown to be useful for summarizing and...
research
∙
12/18/2019
Reconstructing Embedded Graphs from Persistence Diagrams
The persistence diagram (PD) is an increasingly popular topological desc...
research
∙
11/28/2018
Challenges in Reconstructing Shapes from Euler Characteristic Curves
Shape recognition and classification is a problem with a wide variety of...
research
∙
05/27/2018
