The parameterized complexity of sequence alignment and consensus
Theoretical Computer Science
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
New methods for 3-SAT decision and worst-case analysis
Theoretical Computer Science
Near optimal multiple alignment within a band in polynomial time
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Faster exact algorithms for hard problems: a parameterized point of view
Discrete Mathematics
Experimenting an approximation algorithm for the LCS
Discrete Applied Mathematics
Computing similarity between RNA structures
Theoretical Computer Science
Concrete Math
Introduction to Formal Language Theory
Introduction to Formal Language Theory
The longest common subsequence problem for sequences with nested arc annotations
Journal of Computer and System Sciences - Computational biology 2002
Parameterized complexity of finding subgraphs with hereditary properties
Theoretical Computer Science
MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
Pattern Matching for Arc-Annotated Sequences
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Algorithmic Aspects of Protein Structure Similarity
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Algorithms and complexity for annotated sequence analysis
Algorithms and complexity for annotated sequence analysis
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
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
Fast Arc-Annotated Subsequence Matching in Linear Space
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Comparing RNA structures: towards an intermediate model between the edit and the LAPCS problems
BSB'07 Proceedings of the 2nd Brazilian conference on Advances in bioinformatics and computational biology
Parameterized complexity of the arc-preserving subsequence problem
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Faster pattern matching algorithm for arc-annotated sequences
Proceedings of the 2005 international conference on Federation over the Web
Improved algorithms for largest cardinality 2-interval pattern problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Local gapped subforest alignment and its application in finding RNA structural motifs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
What makes the arc-preserving subsequence problem hard?
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
What makes the arc-preserving subsequence problem hard?
Transactions on Computational Systems Biology II
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
The longest common subsequence problem with crossing-free arc-annotated sequences
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Hi-index | 5.23 |
We present exact algorithms for the NP-complete LONGEST COMMON SUBSEQUENCE problem for sequences with nested arc annotations, a problem occurring in structure comparison of RNA. Given two sequences of length at most n and nested arc structure, one of our algorithms determines (if existent) in O(3.31k1+k2 ċ n) time an arc-preserving subsequence of both sequences, which can be obtained by deleting (together with corresponding arcs) k1 letters from the first and k2 letters from the second sequence. A second algorithm shows that, (in case of a four letter alphabet) we can find a length l arc-annotated subsequence in O(12lċlċn) time. This means that the problem is fixed-parameter tractable when parameterized by the number of deletions as well as when parameterized by the subsequence length. Our findings complement known approximation results which give a quadratic time factor-2-approximation for the general and polynomial time approximation schemes for restricted versions of the problem. In addition, we obtain further fixed-parameter tractability results for these restricted versions.