A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem
From MaRDI portal
Recommendations
- Approximating the 2-interval pattern problem
- Algorithms – ESA 2005
- A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model
- Combinatorial Pattern Matching
- On the computational complexity of 2-interval pattern matching problems
- Parameterized complexity of two-interval pattern problem
- Parameterized complexity of two-interval pattern problem
- On two open problems of 2-interval patterns
- scientific article; zbMATH DE number 2087043
- Improved algorithms for largest cardinality 2-interval pattern problem
Cites work
Cited in
(9)- Improved algorithms for largest cardinality 2-interval pattern problem
- A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model
- On Recovering Syntenic Blocks from Comparative Maps
- Parameterized complexity of two-interval pattern problem
- On recovering syntenic blocks from comparative maps
- Algorithms and Computation
- Combinatorial Pattern Matching
- Algorithms – ESA 2005
- Approximating the 2-interval pattern problem
This page was built for publication: A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q996823)