Non-similarity combinatorial problems.
Similarity problems intensively investigated in computational molecular biology have the following two stringology models: find the longest string included in any string of a given finite language, and find the shortest string including every string of a given finite language. These two problems are exemplified by the two well-known pairs of problems, the longest common subsequence (or substring) problem and the shortest common supersequence (or superstring) problem, interpretations. In this paper we consider opposite problems connected with string non-inclusion relations: find the shortest string included in no string of a given finite language and find the longest string including no string of a given finite language. The predicate "string alpha is not included in string beta" is interpreted either as "alpha is not a subsequence of beta" or as "alpha is not a substring of beta". The main purpose is to determine the complexity status of the non-similarity problems. Using graph approaches, we present NP-hardness proofs for the first interpretation and polynomial-time algorithms for the second one. Special cases of the problems, and related issues are discussed.
Department of Transportation Control, National Transport Institute, Moscow, Russia.
A R
AR
Rubinov
V G
VG
Timkovsky
D000465:Algorithms; D004247:DNA / Q000737:chemistry; D008433:Mathematics; D015336:Molecular Probe Techniques / Q000706:statistics & numerical data*; D015345:Oligonucleotide Probes; D012689:Sequence Homology, Nucleic Acid
D015345:Oligonucleotide Probes; D004247:DNA