Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

SIAMDM

1998

1998

For every string inclusion relation there are two optimization problems: ﬁnd a longest string included in every string of a given ﬁnite language, and ﬁnd a shortest string including every string of a given ﬁnite language. As an example, the two well-known pairs of problems, the longest common substring (or subsequence) problem and the shortest common superstring (or supersequence) problem, are interpretations of these two problems. In this paper we consider a class of opposite problems connected with string noninclusion relations: ﬁnd a shortest string included in no string of a given ﬁnite language and ﬁnd a longest string including no string of a given ﬁnite language. The predicate “string α is not included in string β” is interpreted as either “α is not a substring of β” or “α is not a subsequence of β”. The main purpose is to determine the complexity status of the string noninclusion optimization problems. Using graph approaches we present polynomi...

Related Content

Added |
23 Dec 2010 |

Updated |
23 Dec 2010 |

Type |
Journal |

Year |
1998 |

Where |
SIAMDM |

Authors |
Anatoly R. Rubinov, Vadim G. Timkovsky |

Comments (0)