Imagen de Portada

Probabilistic RNA Designability via Interpretable Ensemble Approximation and Dynamic Decomposition

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Zhou, Tianshuo, Mathews, David H., Huang, Liang
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Scalable and Interpretable Identification of Minimal Undesignable RNA Structure Motifs with Rotational Invariance
por: Zhou, Tianshuo, et al.
Publicado: (2024)

LinearPartition: Linear-Time Approximation of RNA Folding Partition Function and Base Pairing Probabilities
por: Zhang, He, et al.
Publicado: (2019)

Evaluating Optimal Safe Flows Decomposition for RNA Assembly
por: Ahmed, Bashar, et al.
Publicado: (2024)

Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition
por: Davies-Peck, Peter
Publicado: (2026)

Approximating Queries on Probabilistic Graphs
por: Amarilli, Antoine, et al.
Publicado: (2023)

Faster Weak Expander Decompositions and Approximate Max Flow
por: Fleischmann, Henry, et al.
Publicado: (2025)

Consistent Low-Rank Approximation
por: Woodruff, David P., et al.
Publicado: (2026)

Fully Dynamic Algorithms for Graph Spanners via Low-Diameter Router Decomposition
por: Chuzhoy, Julia, et al.
Publicado: (2026)

Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs
por: Dong, Sally, et al.
Publicado: (2023)

Designing Approximate Binary Trees for Trees
por: Kellerhals, Leon, et al.
Publicado: (2026)

Improved Approximations for Flexible Network Design
por: Hyatt-Denesik, Dylan, et al.
Publicado: (2024)

LinearAlifold: Linear-Time Consensus Structure Prediction for RNA Alignments
por: Malik, Apoorv, et al.
Publicado: (2022)

Dynamic Hierarchical $j$-Tree Decomposition and Its Applications
por: Goranci, Gramoz, et al.
Publicado: (2026)

Approximation Algorithms for Hop Constrained and Buy-at-Bulk Network Design via Hop Constrained Oblivious Routing
por: Chekuri, Chandra, et al.
Publicado: (2024)

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees
por: Ghaffari, Mohsen, et al.
Publicado: (2025)

Faster Approximation Algorithms for k-Center via Data Reduction
por: Filtser, Arnold, et al.
Publicado: (2025)

Approximation Algorithms for Network Design in Non-Uniform Fault Models
por: Chekuri, Chandra, et al.
Publicado: (2024)

Complexity and Approximation Algorithms for Fixed Charge Transportation Problems
por: Chen, Yong, et al.
Publicado: (2025)

Approximate Graph Propagation Revisited: Dynamic Parameterized Queries, Tighter Bounds and Dynamic Updates
por: Zhao, Zhuowei, et al.
Publicado: (2025)

Dynamic Dyck and Tree Edit Distance: Decompositions and Reductions to String Edit Distance
por: Das, Debarati, et al.
Publicado: (2025)

Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck
por: Kuszmaul, William, et al.
Publicado: (2025)

Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically
por: Buchem, Moritz, et al.
Publicado: (2024)

On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication
por: Liu, Yang P.
Publicado: (2024)

From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation
por: Großmann, Ernestine, et al.
Publicado: (2025)

DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering
por: Yu, Shangdi, et al.
Publicado: (2025)

Tight Sampling Bounds for Eigenvalue Approximation
por: Swartworth, William, et al.
Publicado: (2024)

Optimal 4-Approximation for the Correlated Pandora's Problem
por: Bansal, Nikhil, et al.
Publicado: (2025)

Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation
por: El-Hayek, Antoine, et al.
Publicado: (2024)

Decremental $(1+ε)$-Approximate Maximum Eigenvector: Dynamic Power Method
por: Adil, Deeksha, et al.
Publicado: (2024)

New Diameter Approximations via Distance Oracle Techniques
por: Kirkpatrick, Yael, et al.
Publicado: (2026)

Approximating the Top Eigenvector in Random Order Streams
por: Kacham, Praneeth, et al.
Publicado: (2024)

An FPT Constant-Factor Approximation Algorithm for Correlation Clustering
por: Zhou, Jianqi, et al.
Publicado: (2025)

Dynamic $(1+ε)$-Approximate Matching Size in Truly Sublinear Update Time
por: Bhattacharya, Sayan, et al.
Publicado: (2023)

Faster Algorithms for Schatten-p Low Rank Approximation
por: Kacham, Praneeth, et al.
Publicado: (2024)

Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition
por: Li, Xizhe, et al.
Publicado: (2026)

Hardness and Approximation Algorithms for Balanced Districting Problems
por: Dharangutte, Prathamesh, et al.
Publicado: (2025)

Near-Optimal Parallel Approximate Counting via Sampling
por: Harris, David G., et al.
Publicado: (2026)

A Linear Time Gap-ETH-Tight Approximation Scheme for Euclidean TSP
por: Mömke, Tobias, et al.
Publicado: (2024)

Approximate Cartesian Tree Matching: an Approach Using Swaps
por: Auvray, Bastien, et al.
Publicado: (2023)

Approximating Multiple-Depot Capacitated Vehicle Routing via LP Rounding
por: Friggstad, Zachary, et al.
Publicado: (2025)