Corpus ID: 211082983

Parameterized Complexity of Two-Interval Pattern Problem

@article{Bose2020ParameterizedCO,
  title={Parameterized Complexity of Two-Interval Pattern Problem},
  author={Prosenjit Bose and Saeed Mehrabi and Debajyoti Mondal},
  journal={ArXiv},
  year={2020},
  volume={abs/2002.05099}
}
  • Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal
  • Published in ArXiv 2020
  • Computer Science, Mathematics
  • A \emph{2-interval} is the union of two disjoint intervals on the real line. Two 2-intervals $D_1$ and $D_2$ are \emph{disjoint} if their intersection is empty (i.e., no interval of $D_1$ intersects any interval of $D_2$). There can be three different relations between two disjoint 2-intervals; namely, preceding ($<$), nested ($\sqsubset$) and crossing ($\between$). Two 2-intervals $D_1$ and $D_2$ are called \emph{$R$-comparable} for some $R\in\{<,\sqsubset,\between\}$, if either $D_1RD_2$ or… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Figures and Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 16 REFERENCES

    New Results for the 2-Interval Pattern Problem

    VIEW 9 EXCERPTS
    HIGHLY INFLUENTIAL

    Two-Interval Pattern Problems

    VIEW 9 EXCERPTS
    HIGHLY INFLUENTIAL

    On the computational complexity of 2-interval pattern matching problems

    VIEW 11 EXCERPTS
    HIGHLY INFLUENTIAL

    Pattern Matching Problems over 2-Interval Sets

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    Hoos . HotKnots : Heuristic prediction of RNA secondary structure including pseudoknots

    • Elena Rivas
    • 2005