A Parameterized Study of Maximum Generalized Pattern Matching Problems

@article{Ordyniak2015APS,
  title={A Parameterized Study of Maximum Generalized Pattern Matching Problems},
  author={Sebastian Ordyniak and Alexandru Popa},
  journal={Algorithmica},
  year={2015},
  volume={75},
  pages={1-26}
}
  • Sebastian Ordyniak, Alexandru Popa
  • Published in Algorithmica 2015
  • Mathematics, Computer Science
  • The generalized function matching (GFM) problem has been intensively studied starting with Ehrenfreucht and Rozenberg (Inf Process Lett 9(2):86–88, 1979). Given a pattern p and a text t, the goal is to find a mapping from the letters of p to non-empty substrings of t, such that applying the mapping to p results in t. Very recently, the problem has been investigated within the framework of parameterized complexity (Fernau et al. in FSTTCS, 2013). In this paper we study the parameterized… CONTINUE READING

    Tables and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-8 OF 8 CITATIONS

    Pattern Matching with Variables

    VIEW 5 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Heuristic Algorithm for Generalized Function Matching

    VIEW 2 EXCERPTS
    CITES METHODS

    Matching Patterns with Variables

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Partition on trees with supply and demand: Kernelization and algorithms

    VIEW 1 EXCERPT
    CITES METHODS

    References

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

    Generalized Function Matching

    VIEW 11 EXCERPTS
    HIGHLY INFLUENTIAL

    Algorithmica

    • Algorithmica
    • 2016

    Patterns with bounded treewidth

    VIEW 1 EXCERPT

    Schmid . Patterns with bounded treewidth

    • L Markus
    • Information and Computation
    • 2014

    A note on the complexity of matching patterns with variables

    A note on the complexity ofmatching patternswith variables

    • M. L. Schmid
    • Inf. Process. Lett. 113(19– 21), 729–733
    • 2013
    VIEW 1 EXCERPT