A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem
From MaRDI portal
Publication:996823
DOI10.1007/S10878-006-9024-6zbMATH Open1123.68146OpenAlexW1974900495MaRDI QIDQ996823FDOQ996823
Authors: Minghui Jiang
Publication date: 19 July 2007
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-006-9024-6
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)
- Algorithms – ESA 2005
- Combinatorial Pattern Matching
- Improved algorithms for largest cardinality 2-interval pattern problem
- On recovering syntenic blocks from comparative maps
- Approximating the 2-interval pattern problem
- Parameterized complexity of two-interval pattern problem
- On Recovering Syntenic Blocks from Comparative Maps
- Algorithms and Computation
- A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model
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)