scientific article; zbMATH DE number 2185647
From MaRDI portal
Publication:3024816
Recommendations
Cited in
(13)- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
- On the computational complexity of 2-interval pattern matching problems
- Computing the similarity of two sequences with nested arc annotations
- Extracting constrained 2-interval subsets in 2-interval sets
- Solving longest common subsequence problems via a transformation to the maximum clique problem
- Parameterized complexity of the arc-preserving subsequence problem
- Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots
- How to Compare Arc-Annotated Sequences: The Alignment Hierarchy
- Finding Common RNA Pseudoknot Structures in Polynomial Time
- Finding common RNA pseudoknot structures in polynomial time
- The longest common subsequence problem for arc-annotated sequences
- Approximating the 2-interval pattern problem
- Finding common structured patterns in linear graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3024816)