Parameterized complexity of two-interval pattern problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2087043 (Why is no real title available?)
- scientific article; zbMATH DE number 2119734 (Why is no real title available?)
- A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem
- A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model
- Approximating the 2-interval pattern problem
- Combinatorial Pattern Matching
- Extracting constrained 2-interval subsets in 2-interval sets
- Improved algorithms for largest cardinality 2-interval pattern problem
- On the Approximability of Comparing Genomes with Duplicates
- On the computational complexity of 2-interval pattern matching problems
- On the parameterized complexity of multiple-interval graph problems
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
- On two open problems of 2-interval patterns
- Scheduling Split Intervals
Cited in
(4)
This page was built for publication: Parameterized complexity of two-interval pattern problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2067621)