Improved algorithms for largest cardinality 2-interval pattern problem
From MaRDI portal
(Redirected from Publication:996829)
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 2119734 (Why is no real title available?)
- Algorithms and Computation
- Algorithms – ESA 2005
- Combinatorial Pattern Matching
- Computing the similarity of two sequences with nested arc annotations
- Efficient algorithms for finding maximum cliques of an overlap graph
- On the computational complexity of 2-interval pattern matching problems
- The longest common subsequence problem for arc-annotated sequences
- Trapezoid graphs and generalizations, geometry and algorithms
Cited in
(10)- 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
- 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
- On two open problems of 2-interval patterns
- On recognising words that are squares for the shuffle product
- Approximating the 2-interval pattern problem
This page was built for publication: Improved algorithms for largest cardinality 2-interval pattern problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q996829)