Evaluating Optimal Safe Flows Decomposition for RNA Assembly
Fuente:
arXiv
Saved in:
| Main Authors: | Ahmed, Bashar, Rana, Siddharth Singh, Ujjwal, Khan, Shahbaz |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Practical algorithms for Hierarchical overlap graphs
by: Talera, Saumya, et al.
Published: (2024)
by: Talera, Saumya, et al.
Published: (2024)
Dynamic Breadth First Search with Predictions
by: Khan, Shahbaz, et al.
Published: (2026)
by: Khan, Shahbaz, et al.
Published: (2026)
Expander Decomposition with Almost Optimal Overhead
by: Bansal, Nikhil, et al.
Published: (2026)
by: Bansal, Nikhil, et al.
Published: (2026)
Width Parameters for Minimum Flow Decomposition
by: Grigorjew, Andreas, et al.
Published: (2024)
by: Grigorjew, Andreas, et al.
Published: (2024)
Near-Optimal Algorithm for Directed Expander Decompositions
by: Sulser, Aurelio L., et al.
Published: (2024)
by: Sulser, Aurelio L., et al.
Published: (2024)
Near-Optimal Directed Low-Diameter Decompositions
by: Bringmann, Karl, et al.
Published: (2025)
by: Bringmann, Karl, et al.
Published: (2025)
Probabilistic RNA Designability via Interpretable Ensemble Approximation and Dynamic Decomposition
by: Zhou, Tianshuo, et al.
Published: (2026)
by: Zhou, Tianshuo, et al.
Published: (2026)
Engineering Semi-streaming DFS algorithms
by: Bhagavan, Kancharla Nikhilesh, et al.
Published: (2024)
by: Bhagavan, Kancharla Nikhilesh, et al.
Published: (2024)
Faster Weak Expander Decompositions and Approximate Max Flow
by: Fleischmann, Henry, et al.
Published: (2025)
by: Fleischmann, Henry, et al.
Published: (2025)
Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal
by: Chen, Daoyuan, et al.
Published: (2024)
by: Chen, Daoyuan, et al.
Published: (2024)
A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs
by: Alejandro-Soto, J. A., et al.
Published: (2025)
by: Alejandro-Soto, J. A., et al.
Published: (2025)
Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs
by: Dong, Sally, et al.
Published: (2023)
by: Dong, Sally, et al.
Published: (2023)
Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts
by: Haeupler, Bernhard, et al.
Published: (2025)
by: Haeupler, Bernhard, et al.
Published: (2025)
How to Protect Yourself from Threatening Skeletons: Optimal Padded Decompositions for Minor-Free Graphs
by: Conroy, Jonathan, et al.
Published: (2025)
by: Conroy, Jonathan, et al.
Published: (2025)
Learning-Based Heavy Hitters and Flow Frequency Estimation in Streams
by: Shahout, Rana, et al.
Published: (2024)
by: Shahout, Rana, et al.
Published: (2024)
A Decomposition Theorem for Dynamic Flows
by: Graf, Lukas, et al.
Published: (2024)
by: Graf, Lukas, et al.
Published: (2024)
Towards Optimal Grammars for RNA Structures
by: Onokpasa, Evarista, et al.
Published: (2024)
by: Onokpasa, Evarista, et al.
Published: (2024)
Optimal Padded Decomposition For Bounded Treewidth Graphs
by: Filtser, Arnold, et al.
Published: (2024)
by: Filtser, Arnold, et al.
Published: (2024)
Computing Experiment-Constrained D-Optimal Designs
by: Pillai, Aditya, et al.
Published: (2024)
by: Pillai, Aditya, et al.
Published: (2024)
Parallel $(1+ε)$-Approximate Multi-Commodity Mincost Flow in Almost Optimal Depth and Work
by: Haeupler, Bernhard, et al.
Published: (2025)
by: Haeupler, Bernhard, et al.
Published: (2025)
On the Streaming Complexity of Expander Decomposition
by: Chen, Yu, et al.
Published: (2024)
by: Chen, Yu, et al.
Published: (2024)
Individual Fairness in Graph Decomposition
by: Munagala, Kamesh, et al.
Published: (2024)
by: Munagala, Kamesh, et al.
Published: (2024)
Improved Directed Expander Decompositions
by: Fleischmann, Henry, et al.
Published: (2025)
by: Fleischmann, Henry, et al.
Published: (2025)
A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs
by: Singh, Rajpreet, et al.
Published: (2025)
by: Singh, Rajpreet, et al.
Published: (2025)
Parallel Higher-order Truss Decomposition
by: Chen, Chen, et al.
Published: (2024)
by: Chen, Chen, et al.
Published: (2024)
Unbreakable Decomposition in Close-to-Linear Time
by: Anand, Aditya, et al.
Published: (2024)
by: Anand, Aditya, et al.
Published: (2024)
Linear-Time Safe-Alternating DFS and SCCs
by: Comin, Carlo, et al.
Published: (2016)
by: Comin, Carlo, et al.
Published: (2016)
Simple Length-Constrained Expander Decompositions
by: Bodwin, Greg, et al.
Published: (2025)
by: Bodwin, Greg, et al.
Published: (2025)
Compressing Suffix Trees by Path Decompositions
by: Becker, Ruben, et al.
Published: (2025)
by: Becker, Ruben, et al.
Published: (2025)
Eulerian Graph Sparsification by Effective Resistance Decomposition
by: Jambulapati, Arun, et al.
Published: (2024)
by: Jambulapati, Arun, et al.
Published: (2024)
Expander Decomposition for Non-Uniform Vertex Measures
by: Agassy, Daniel, et al.
Published: (2025)
by: Agassy, Daniel, et al.
Published: (2025)
Simpler and Faster Directed Low-Diameter Decompositions
by: Li, Jason
Published: (2025)
by: Li, Jason
Published: (2025)
Optimal and Efficient Partite Decompositions of Hypergraphs
by: Krapivin, Andrew, et al.
Published: (2025)
by: Krapivin, Andrew, et al.
Published: (2025)
Efficient Leverage Score Sampling for Tensor Train Decomposition
by: Bharadwaj, Vivek, et al.
Published: (2024)
by: Bharadwaj, Vivek, et al.
Published: (2024)
New Structures and Algorithms for Length-Constrained Expander Decompositions
by: Haeupler, Bernhard, et al.
Published: (2024)
by: Haeupler, Bernhard, et al.
Published: (2024)
Deterministic Padded Decompositions and Negative-Weight Shortest Paths
by: Li, Jason
Published: (2025)
by: Li, Jason
Published: (2025)
Dynamic Hierarchical $j$-Tree Decomposition and Its Applications
by: Goranci, Gramoz, et al.
Published: (2026)
by: Goranci, Gramoz, et al.
Published: (2026)
Median and Small Parsimony Problems on RNA trees
by: Marchand, Bertrand, et al.
Published: (2024)
by: Marchand, Bertrand, et al.
Published: (2024)
Rapid Exploration of Assembly Chemical Space of Molecular Graphs
by: Seet, Ian, et al.
Published: (2024)
by: Seet, Ian, et al.
Published: (2024)
Approximately Optimal Core Shapes for Tensor Decompositions
by: Ghadiri, Mehrdad, et al.
Published: (2023)
by: Ghadiri, Mehrdad, et al.
Published: (2023)
Similar Items
-
Practical algorithms for Hierarchical overlap graphs
by: Talera, Saumya, et al.
Published: (2024) -
Dynamic Breadth First Search with Predictions
by: Khan, Shahbaz, et al.
Published: (2026) -
Expander Decomposition with Almost Optimal Overhead
by: Bansal, Nikhil, et al.
Published: (2026) -
Width Parameters for Minimum Flow Decomposition
by: Grigorjew, Andreas, et al.
Published: (2024) -
Near-Optimal Algorithm for Directed Expander Decompositions
by: Sulser, Aurelio L., et al.
Published: (2024)