scientific article; zbMATH DE number 3984596

Cited in

(48)

Parallel string matching with k mismatches
Data structures and algorithms for approximate string matching
Period recovery of strings over the Hamming and edit distances
On string matching with mismatches
On the string matching with \(k\) mismatches
A randomized numerical aligner (rNA)
Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching
Fast and practical approximate string matching
Pattern matching in the Hamming distance with thresholds
Multidimensional period recovery
2-dimensional palindromes with k mismatches
Fast parallel and serial multidimensional approximate array matching
Approximate periodicity
Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time
Locating maximal approximate runs in a string
Extending alignments with k-mismatches and -gaps
Checking whether a word is Hamming-isometric in linear time
Double string tandem repeats
Fast and simple computations using prefix tables under Hamming and edit distance
On pattern matching with \(k\) mismatches and few don't cares
Boyer-Moore approach to approximate string matching
Small-space LCE data structure with constant-time queries
On approximate pattern matching with thresholds
Simple and efficient string matching with k mismatches
Efficient identification of k-closed strings
Practical Performance of Space Efficient Data Structures for Longest Common Extensions.
Maximal degenerate palindromes with gaps and mismatches
Exact and inexact search for 2d side-sharing tandems
A fast algorithm for string matching with mismatches
Small-space algorithms for the online language distance problem for palindromes and squares
Elastic-degenerate string comparison
String searching with mismatches using AVX2 and AVX-512 instructions
On the Weihrauch degree of the additive Ramsey theorem
Hilbert's tenth problem for term algebras with a substitution operator
Complemented subsets and Boolean-valued, partial functions
Defining long words succinctly in FO and MSO
On the first-order parts of problems in the Weihrauch degrees
Algorithmically random series
Ideal presentations and numberings of some classes of effective quasi-Polish spaces
Lower bounds on () and other properties of -register machines
Reifying dynamical algebra: maximal ideals in countable rings, constructively
Maps for learning indexable classes
On the necessity of some topological spaces
Computing the index of non-isometric k-ary words with Hamming and Lee distance
Quantum speed-ups for string synchronizing sets, longest common substring, and k-mismatch matching
Longest common extensions with wildcards: trade-off and applications
Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances
Pattern matching with address errors: rearrangement distances

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3747742)