How to Compare Arc-Annotated Sequences: The Alignment Hierarchy
From MaRDI portal
Publication:3523001
DOI10.1007/11880561_24zbMath1175.92018MaRDI QIDQ3523001
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
algorithm; computational biology; NP-hardness; RNA structures; edit distance; arc-annotated sequences
92C40: Biochemistry, molecular biology
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
65Y20: Complexity and performance of numerical algorithms
68W32: Algorithms on strings
92C42: Systems biology, networks
Related Items
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, Average complexity of the Jiang-Wang-Zhang pairwise tree alignment algorithm and of an RNA secondary structure alignment algorithm, Fast arc-annotated subsequence matching in linear space, Forest Alignment with Affine Gaps and Anchors