2 papers
cs.CC2014
A Parameterized Study of Maximum Generalized Pattern Matching Problems
Sebastian Ordyniak, Alexandru Popa
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…
cs.DS2010
Restricted Common Superstring and Restricted Common Supersequence
Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein +1
The {\em shortest common superstring} and the {\em shortest common supersequence} are two well studied problems having a wide range of applications. In this paper we consider both…