Hardness of RNA Folding Problem With Four Symbols.

DOI10.4230/LIPIcs.CPM.2016.13zbMath1382.68086OpenAlexW2962914331MaRDI QIDQ5369547

Yi-Jun Chang

Publication date: 17 October 2017

Full work available at URL: https://doi.org/10.4230/LIPIcs.CPM.2016.13

zbMATH Keywords

cliquelongest common subsequenceRNA foldingconditional lower boundDyck edit distance

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms on strings (68W32)

Related Items (6)

If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser ⋮ Hardness of RNA folding problem with four symbols ⋮ Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Elastic-Degenerate String Matching via Fast Matrix Multiplication

This page was built for publication: Hardness of RNA Folding Problem With Four Symbols.