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.
An o (n 5) algorithm for mfe prediction of kissing hairpins and 4-chains in nucleic acids
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
CONDITIONAL 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.