On the computational complexity of 2-interval pattern matching problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2087043
- Parameterized complexity of two-interval pattern problem
- Parameterized complexity of two-interval pattern problem
- Approximating the 2-interval pattern problem
- Algorithms – ESA 2005
- Approximation algorithms for maximum two-dimensional pattern matching
- Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time
- scientific article; zbMATH DE number 1003305
- On the complexity of timed pattern matching
- Two-dimensional pattern matching in linear time and small space
Cites work
- scientific article; zbMATH DE number 1615278 (Why is no real title available?)
- scientific article; zbMATH DE number 2185647 (Why is no real title available?)
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 2087043 (Why is no real title available?)
- scientific article; zbMATH DE number 2087047 (Why is no real title available?)
- scientific article; zbMATH DE number 2119734 (Why is no real title available?)
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- Branch-and-Bound Methods: A Survey
- Efficient algorithms for interval graphs and circular-arc graphs
- New clique and independent set algorithms for circle graphs
- Ordered and Unordered Tree Inclusion
- RNA secondary structures and their prediction
- Recognizing graphs with fixed interval number is NP-complete
- Topics in Intersection Graph Theory
- Trapezoid graphs and generalizations, geometry and algorithms
- Trapezoid graphs and their coloring
Cited in
(22)- Extracting constrained 2-interval subsets in 2-interval sets
- A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem
- Improved algorithms for largest cardinality 2-interval pattern problem
- scientific article; zbMATH DE number 2087043 (Why is no real title available?)
- On Recovering Syntenic Blocks from Comparative Maps
- Winner determination in geometrical combinatorial auctions
- Fast arc-annotated subsequence matching in linear space
- Parameterized complexity of two-interval pattern problem
- On recovering syntenic blocks from comparative maps
- Recognizing unit multiple interval graphs is hard
- Finding common structured patterns in linear graphs
- On the parameterized complexity of some optimization problems related to multiple-interval graphs
- Pattern Matching with Variables: A Multivariate Complexity Analysis
- On two open problems of 2-interval patterns
- Complexity issues in color-preserving graph embeddings
- Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time
- DARN! A weighted constraint solver for RNA motif localization
- Recognizing \(d\)-interval graphs and \(d\)-track interval graphs
- Finding common RNA pseudoknot structures in polynomial time
- On recognising words that are squares for the shuffle product
- Algorithms – ESA 2005
- Approximation of RNA multiple structural alignment
This page was built for publication: On the computational complexity of 2-interval pattern matching problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1884946)
