Pages that link to "Item:Q1884946"

The following pages link to On the computational complexity of 2-interval pattern matching problems (Q1884946):

Displaying 17 items.

• On the parameterized complexity of some optimization problems related to multiple-interval graphs (Q606990) (← links)
• Finding common RNA pseudoknot structures in polynomial time (Q655437) (← links)
• Approximation of RNA multiple structural alignment (Q655441) (← links)
• Complexity issues in color-preserving graph embeddings (Q846361) (← links)
• DARN! A weighted constraint solver for RNA motif localization (Q941671) (← links)
• Finding common structured patterns in linear graphs (Q974741) (← links)
• A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem (Q996823) (← links)
• Improved algorithms for largest cardinality 2-interval pattern problem (Q996829) (← links)
• On two open problems of 2-interval patterns (Q1019722) (← links)
• On recovering syntenic blocks from comparative maps (Q1041433) (← links)
• Winner determination in geometrical combinatorial auctions (Q1698906) (← links)
• Parameterized complexity of two-interval pattern problem (Q2067621) (← links)
• Recognizing \(d\)-interval graphs and \(d\)-track interval graphs (Q2375953) (← links)
• Fast arc-annotated subsequence matching in linear space (Q2428660) (← links)
• Extracting constrained 2-interval subsets in 2-interval sets (Q2456375) (← links)
• On recognising words that are squares for the shuffle product (Q2699216) (← links)
• On Recovering Syntenic Blocks from Comparative Maps (Q5505670) (← links)