Copertina

An efficient algorithm to compute the minimum free energy of interacting nucleic acid strands

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Shalaby, Ahmed, Woods, Damien
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms Computational Complexity Discrete Mathematics Biological Physics Biomolecules F.2; F.2.0; F.2.3; G.2; G.2.1; G.2.2
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Algorithmic hardness of the partition function for nucleic acid strands
di: Ducloz, Gwendal, et al.
Pubblicazione: (2025)

Beyond Worst-Case Subset Sum: An Adaptive, Structure-Aware Solver with Sub-$2^{n/2}$ Enumeration
di: Salas, Jesus
Pubblicazione: (2025)

NP-Completeness of the Combinatorial Distance Matrix Realisation Problem
di: Fairbairn, David L., et al.
Pubblicazione: (2024)

When Votes Change and Committees Should (Not)
di: Bredereck, Robert, et al.
Pubblicazione: (2020)

Efficient Uniform Sampling of Surjections via their Profiles
di: Carayol, Arnaud, et al.
Pubblicazione: (2026)

A polynomial-time algorithm for recognizing high-bandwidth graphs
di: Varona, Luis M. B.
Pubblicazione: (2026)

Efficient Approximation of Fractional Hypertree Width
di: Korchemna, Viktoriia, et al.
Pubblicazione: (2024)

Deterministic Minimum Steiner Cut in Maximum Flow Time
di: Ding, Matthew, et al.
Pubblicazione: (2023)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
di: Eiben, Eduard, et al.
Pubblicazione: (2023)

Forward-backward Contention Resolution Schemes for Fair Rationing
di: Ma, Will, et al.
Pubblicazione: (2025)

An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
di: Ibrahimpur, Sharat, et al.
Pubblicazione: (2025)

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
di: Chen, Yijia, et al.
Pubblicazione: (2023)

Approximation Algorithms for Correlated Knapsack Orienteering
di: Espinosa, David Aleman, et al.
Pubblicazione: (2024)

Eliminating Illusion in Directed Networks
di: Jana, Sougata, et al.
Pubblicazione: (2026)

Min cost flow on unit capacity networks and convex cost K-flow are as easy as the assignment problem with All-Min-Cuts algorithm
di: Hochbaum, Dorit S.
Pubblicazione: (2016)

Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
di: Gillman, David, et al.
Pubblicazione: (2025)

The Constrained Layer Tree Problem and Applications to Solar Farm Cabling
di: Bläsius, Thomas, et al.
Pubblicazione: (2024)

Approximation Algorithms for Capacitated Vehicle Routing Problems: A Comprehensive Survey
di: Chen, Yongyu
Pubblicazione: (2023)

Graph Threading with Turn Costs
di: Demaine, Erik D., et al.
Pubblicazione: (2024)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
di: Dvořák, Pavel, et al.
Pubblicazione: (2017)

Realizing temporal graphs from fastest travel times
di: Klobas, Nina, et al.
Pubblicazione: (2023)

A Piecewise Approach for the Analysis of Exact Algorithms
di: Clinch, Katie, et al.
Pubblicazione: (2024)

Online Bipartite Matching in the Probe-Commit Model
di: Borodin, Allan, et al.
Pubblicazione: (2023)

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
di: Ma, Will, et al.
Pubblicazione: (2024)

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
di: MacRury, Calum, et al.
Pubblicazione: (2022)

PosSLP and Sum of Squares
di: Bläser, Markus, et al.
Pubblicazione: (2024)

Unsplittable Multicommodity Flows in Outerplanar Graphs
di: Alemán-Espinosa, David, et al.
Pubblicazione: (2025)

Output-sensitive Complexity of Multi-Objective Integer Network Flow Problems
di: Könen, David, et al.
Pubblicazione: (2023)

New Results on Edge-coloring and Total-coloring of Split Graphs
di: Couto, Fernanda, et al.
Pubblicazione: (2023)

Faster shortest-path algorithms using the acyclic-connected tree
di: Stefansson, Elis, et al.
Pubblicazione: (2025)

The Banach-Butterfly Invariant: Influence-Adaptive Walsh Geometry for Ternary Polynomial Threshold Functions
di: Pavlov, Gorgi
Pubblicazione: (2026)

Min-CSPs on Complete Instances
di: Anand, Aditya, et al.
Pubblicazione: (2024)

Better Approximation for Weighted $k$-Matroid Intersection
di: Singer, Neta, et al.
Pubblicazione: (2024)

Loop unrolling of UCA models: distance labeling
di: Soulignac, Francisco J, et al.
Pubblicazione: (2022)

Probabilistic Analysis of Edge Elimination for Euclidean TSP
di: Zhong, Xianghui
Pubblicazione: (2018)

Slow Convergence of Ising and Spin Glass Models with Well-Separated Frustrated Vertices
di: Gillman, David, et al.
Pubblicazione: (2026)

An algorithmic Vizing's theorem: toward efficient edge-coloring sampling with an optimal number of colors
di: De Meyer, Lucas, et al.
Pubblicazione: (2025)

Dynamic Traffic Assignment for Public Transport with Vehicle Capacities
di: Patzner, Julian, et al.
Pubblicazione: (2024)

On Minimum Maximal Distance-k Matchings
di: Kartynnik, Yury, et al.
Pubblicazione: (2016)

Benchmarking of algorithms for set partitions
di: Khinvasara, Arnav, et al.
Pubblicazione: (2026)