Computing the partition function of nucleic acid secondary structures is #P-hard for unbounded multi-strand systems and for single strands with pseudoknots, under simple energy models.
Demaine, Martin L
1 Pith paper cite this work, alongside 2 external citations. Polarity classification is still indexing.
1
Pith paper citing it
2
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.CC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Algorithmic hardness of the partition function for nucleic acid strands
Computing the partition function of nucleic acid secondary structures is #P-hard for unbounded multi-strand systems and for single strands with pseudoknots, under simple energy models.