Computing similarity between RNA structures
Theoretical Computer Science
The longest common subsequence problem for sequences with nested arc annotations
Journal of Computer and System Sciences - Computational biology 2002
Finding Common Subsequences with Arcs and Pseudoknots
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Algorithms and complexity for annotated sequence analysis
Algorithms and complexity for annotated sequence analysis
Computing the similarity of two sequences with nested arc annotations
Theoretical Computer Science
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Pattern matching for arc-annotated sequences
ACM Transactions on Algorithms (TALG)
A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
Information Processing Letters
What makes the arc-preserving subsequence problem hard?
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
Parameterized algorithms for inclusion of linear matchings
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
| Hi-index | 0.00 |
We study the ARC-PRESERVING SUBSEQUENCE (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete characters from T to obtain P. Since even the unary version of APS is NP-hard, we used the framework of parameterized complexity, focusing on a parameterization of this problem where the parameter is the number of deletions we can make. We present a linear-time FPT algorithm for a generalization of APS, applying techniques originally designed to give an FPT algorithm for INDUCED SUBGRAPH ISOMORPHISM on interval graphs [12].