Results 11 to 20 of about 38,188 (290)
Differentially Private Approximate Pattern Matching
CoRR, 2023 In this paper, we consider the $k$-approximate pattern matching problem under differential privacy, where the goal is to report or count all substrings of a given string $S$ which have a Hamming distance at most $k$ to a pattern $P$, or decide whether such a substring exists.
Steiner, Teresa Anna
openaire +5 more sources
Improved approximate pattern matching on hypertext
Theoretical Computer Science, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gonzalo Navarro, Navarro, Gonzalo
openaire +5 more sources
A black box for online approximate pattern matching
Information and Computation, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Raphaël Clifford +3 more
core +5 more sources
Approximating approximate pattern matching [PDF]
, 2019 ISSN:1868 ...
Studený, Jan +1 more
openaire +3 more sources
Faster Approximate Pattern Matching: A Unified Approach [PDF]
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020 74 pages, 7 figures, FOCS ...
Panagiotis Charalampopoulos +2 more
openaire +6 more sources
Communication and Streaming Complexity of Approximate Pattern Matching. [PDF]
, 2017 We consider the approximate pattern matching problem. Given a text T of length 2n and a pattern P of length n, the task is to decide for each prefix T[1, j] of T if it ends with a string that is at the edit distance at most k from P. If this is the case, we must output the edit distance and the corresponding edit operations.
Starikovskaya, Tatiana
openaire +4 more sources
Pattern-matching with bounded gaps in genomic sequences
Revista Colombiana de Computación, 2009 Recently, some pattern matching algorithms allowing gaps were introduced in Crochemore et al. [Approximate string matching with gaps. Nordic Journal of Computing, 9 (2002):54–65, 2002], where upper-bounded, strict-bounded and unbounded gaps were ...
Yoan José Pinzon Ardila, Shu Wang
doaj +2 more sources
Hierarchical Missing Data and Multivariate Behrens–Fisher Problem
Journal of Mathematics, 2021 This article firstly defines hierarchical data missing pattern, which is a generalization of monotone data missing pattern. Then multivariate Behrens–Fisher problem with hierarchical missing data is considered to illustrate that how ideas in dealing with
Jianqi Yu
doaj +1 more source
Approximating Approximate Pattern Matching
CoRR, 2018 ISSN:1868 ...
Jan Studený, Przemyslaw Uznanski
openaire +4 more sources
Capturing Topology in Graph Pattern Matching [PDF]
, 2011 Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead.
Huai, Jinpeng +9 more
core +1 more source