Fast arc-annotated subsequence matching in linear space
From MaRDI portal
Publication:2428660
DOI10.1007/s00453-010-9451-8zbMath1236.68305arXiv0911.0577OpenAlexW2166871940WikidataQ60554420 ScholiaQ60554420MaRDI QIDQ2428660
Publication date: 26 April 2012
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.0577
Cites Work
- Unnamed Item
- A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
- Algorithmic aspects of bioinformatics. Translated from the German original
- The longest common subsequence problem for sequences with nested arc annotations.
- On the computational complexity of 2-interval pattern matching problems
- Computing the similarity of two sequences with nested arc annotations
- Fast Algorithms for Finding Nearest Common Ancestors
- How to Compare Arc-Annotated Sequences: The Alignment Hierarchy
- Fast RNA Structure Alignment for Crossing Input Structures
- More Efficient Algorithm for Ordered Tree Inclusion
- Ordered and Unordered Tree Inclusion
- What Makes the Arc-Preserving Subsequence Problem Hard?
- Automata, Languages and Programming