منابع مشابه
Approximate Periods of Strings
The study of approximately periodic strings is relevant to diverse applications such as molecular biology data compression and computer assisted music analysis Here we study di erent forms of ap proximate periodicity under a variety of distance rules We consider three related problems for two of which we derive polynomial time algorithms we then show that the third problem is NP complete
متن کاملApproximate Periods of Strings for Absolute Distances
Approximate periods of strings can be used to find approximate repetitive regularities in strings. In this paper we consider the approximate period problem for different absolute distances.
متن کاملCombinatorics of Periods in Strings
We consider the set Γ (n) of all period sets of strings of length n over a finite alphabet. We show that there is redundancy in period sets and introduce the notion of an irreducible period set. We prove that Γ (n) is a lattice under set inclusion and does not satisfy the JordanDedekind condition. We propose the first enumeration algorithm for Γ (n) and improve upon the previously known asympto...
متن کاملApproximate Seeds of Strings
In this paper we study approximate seeds of strings, that is, substrings of a given string x that cover (by concatenations or overlaps) a superstring of x, under a variety of distance rules (the Hamming distance, the edit distance, and the weighted edit distance). We solve the smallest distance approximate seed problem and the restricted smallest approximate seed problem in polynomial time and ...
متن کاملApproximate Cover of Strings
Regularities in strings arise in various areas of science, including coding and automata theory, formal language theory, combinatorics, molecular biology and many others. A common notion to describe regularity in a string T is a cover, which is a string C for which every letter of T lies within some occurrence of C. The alignment of the cover repetitions in the given text is called a tiling. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00365-0