Circular pattern matching with k mismatches
نویسندگان
چکیده
منابع مشابه
Order-Preserving Pattern Matching with k Mismatches
We study a generalization of the order-preserving pattern matching recently introduced by Kubica et al. (Inf. Process. Let., 2013) and Kim et al. (submitted to Theor. Comp. Sci.), where instead of looking for an exact copy of the pattern, we only require that the relative order between the elements is the same. In our variant, we additionally allow up to k mismatches between the pattern of leng...
متن کاملOn pattern matching with k mismatches and few don't cares
We consider the problem of pattern matching with k mismatches, where there can be don't care or wild card characters in the pattern. Specifically, given a pattern P of length m and a text T of length n, we want to find all occurrences of P in T that have no more than k mismatches. The pattern can have don't care characters, which match any character. Without don't cares, the best known algorith...
متن کاملOptimal trade-offs for pattern matching with k mismatches
Given a pattern of length m and a text of length n, the goal in k-mismatch pattern matching is to compute, for every m-substring of the text, the exact Hamming distance to the pattern or report that it exceeds k. This can be solved in either Õ(n √ k) time as shown by Amir et al. [J. Algorithms 2004] or Õ((m + k) · n/m) time due to a result of Clifford et al. [SODA 2016]. We provide a smooth tim...
متن کاملApproximate pattern matching with k-mismatches in packed text
Given strings P of length m and T of length n over an alphabet of size σ, the string matching with k-mismatches problem is to find the positions of all the substrings in T that are at Hamming distance at most k from P . If T can be read only one character at the time the best known bounds are O(n √ k log k) and O(n+ n √ k/w log k) in the word-RAM model with word length w. In the RAM models (inc...
متن کاملOn string matching with k mismatches
In this paper we consider several variants of the pattern matching problem. In particular, we investigate the following problems: 1) Pattern matching with k mismatches; 2) Approximate counting of mismatches; and 3) Pattern matching with mismatches. The distance metric used is the Hamming distance. We present some novel algorithms and techniques for solving these problems. Both deterministic and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2021
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2020.07.003