A Parameterized Study of Maximum Generalized Pattern Matching Problems

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F14%3A00077725" target="_blank" >RIV/00216224:14330/14:00077725 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-13524-3_23" target="_blank" >http://dx.doi.org/10.1007/978-3-319-13524-3_23</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-13524-3_23" target="_blank" >10.1007/978-3-319-13524-3_23</a>

Result language
angličtina
Original language name
A Parameterized Study of Maximum Generalized Pattern Matching Problems
Original language description
The generalized function matching (GFM) problem has been intensively studied starting with [Ehrenfeucht and Rozenberg, 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, Schmid, and Villanger, 2013]. In this paper we study the parameterized complexity of the optimization variant of GFM (called Max-GFM), which has been introduced in [Amir and Nor, 2007]. Here, one is allowed to replace some of the pattern letters with some special symbols ``?'', termed wildcards or don't cares, which can be mapped to an arbitrary substring of thetext. The goal is to minimize the number of wildcards used.
Czech name
—
Czech description
—

Project
<a href="/en/project/EE2.3.30.0009" target="_blank" >EE2.3.30.0009: Employment of Newly Graduated Doctors of Science for Scientific Excellence</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)