Parameterized complexity of two-interval pattern problem

DOI10.1016/j.tcs.2021.12.005OpenAlexW4206236434MaRDI QIDQ2067621

Debajyoti Mondal, Saeed Mehrabi, Prosenjit Bose

Publication date: 18 January 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.05099

zbMATH Keywords

interval graphsparameterized complexitytwo-interval pattern

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• HotKnots

Cites Work

• Unnamed Item
• Unnamed Item
• Approximating the 2-interval pattern problem
• A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem
• Improved algorithms for largest cardinality 2-interval pattern problem
• On the parameterized complexity of multiple-interval graph problems
• On two open problems of 2-interval patterns
• On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
• On the computational complexity of 2-interval pattern matching problems
• Extracting constrained 2-interval subsets in 2-interval sets
• A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model
• On the Approximability of Comparing Genomes with Duplicates
• Combinatorial Pattern Matching
• Scheduling Split Intervals

This page was built for publication: Parameterized complexity of two-interval pattern problem