How to Compare Arc-Annotated Sequences: The Alignment Hierarchy

DOI10.1007/11880561_24zbMath1175.92018OpenAlexW1608065338MaRDI QIDQ3523001

Guillaume Blin, Hélène Touzet

Publication date: 4 September 2008

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11880561_24

zbMATH Keywords

algorithmcomputational biologyNP-hardnessRNA structuresedit distancearc-annotated sequences

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity and performance of numerical algorithms (65Y20) Algorithms on strings (68W32) Systems biology, networks (92C42)

Related Items (5)

Forest alignment with affine gaps and anchors, applied in RNA structure comparison ⋮ A new algorithm for aligning nested arc-annotated sequences under arbitrary weight schemes ⋮ Fast arc-annotated subsequence matching in linear space ⋮ Forest Alignment with Affine Gaps and Anchors ⋮ Average complexity of the Jiang-Wang-Zhang pairwise tree alignment algorithm and of an RNA secondary structure alignment algorithm

This page was built for publication: How to Compare Arc-Annotated Sequences: The Alignment Hierarchy