Computing similarity between RNA structures

DOI10.1016/S0304-3975(01)00192-XzbMath1002.68058MaRDI QIDQ1605306

Lusheng Wang, Bin Ma, Zhang, Kaizhong

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

similaritymolecular biologyRNA structuresinapproximability

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational methods for problems pertaining to biology (92-08)

Related Items (5)

Computing the similarity of two sequences with nested arc annotations ⋮ A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs ⋮ A new algorithm for aligning nested arc-annotated sequences under arbitrary weight schemes ⋮ Algorithms for finding a most similar subforest ⋮ Parameterized Complexity of the Arc-Preserving Subsequence Problem

Uses Software

• RNAlign

Cites Work

• Unnamed Item
• RNA secondary structures and their prediction
• Comparison of biosequences
• Optimization, approximation, and complexity classes
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• On Finding All Suboptimal Foldings of an RNA Molecule
• The Tree-to-Tree Correction Problem
• On the complexity of comparing evolutionary trees

This page was built for publication: Computing similarity between RNA structures