For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string including every string of a given finite 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, ...

Symmetry is an important shape feature. In this paper, a simple and fast method to detect perfect and distorted rotational symmetries of 2D objects is described. The boundary of a shape is polygonally approximated and represented as a string. Rotational symmetries are found by cyclic string matching between two identical copies of the shape string. The set of minimum cost edit sequences that tr...

In this paper we consider several new versions of approximate string matching with gaps. The main characteristic of these new versions is the existence of gaps in the matching of a given pattern in a text. Algorithms are sketched for each version and their time and space complexity is stated. The specific versions of approximate string matching have various applications in computerized music an...

Bianchi type-VI0 space time with strange quark matter attached to string cloud in Nordtvedt [1] general scalar tensor theory of gravitation with the help of a special case proposed by Schwinger [2] is obtained. The field equations have been solved by using the anisotropy feature of the universe in the Bianchi type-VI0 space time. Some important features of the model, thus obtained, have been di...