Pattern matching for arc-annotated sequences

DOI10.1145/1125994.1125997zbMath1321.68552OpenAlexW2018076990MaRDI QIDQ2944505

Jens Gramm, Jiong Guo, Rolf Niedermeier

Publication date: 2 September 2015

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1125994.1125997

zbMATH Keywords

dynamic programmingpattern matchingRNA secondary structurearc-annotated sequences

Mathematics Subject Classification ID

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

Related Items (4)

Solving longest common subsequence problems via a transformation to the maximum clique problem ⋮ Efficient pattern matching for RNA secondary structures ⋮ Parameterized Complexity of the Arc-Preserving Subsequence Problem ⋮ Finding occurrences of protein complexes in protein-protein interaction graphs

This page was built for publication: Pattern matching for arc-annotated sequences