scientific article; zbMATH DE number 3471577

Cited in

(only showing first 100 items - show all)

Faster pattern matching with character classes using prime number encoding
On special families of morphisms related to \(\delta \)-matching and don't care symbols
Polynomial division and its computational complexity
Sequential and parallel complexity of approximate evaluation of polynomial zeros
Parallel string matching with k mismatches
Data structures and algorithms for approximate string matching
Complexity, combinatorial group theory and the language of palutators
A logarithmic Boolean time algorithm for parallel polynomial division
A simplified proof of the real-time recognizability of palindromes on Turing machines
Linear-time string-matching using only a fixed number of local storage locations
A note on the subtree isomorphism for ordered trees and related problems
Fast average-case pattern matching by multiplexing sparse tables
Two fast simulations which imply some fast string matching and palindrome-recognition algorithms
Palindrome recognition in real time by a multitape Turing machine
Fast algorithms for approximately counting mismatches
The derivation of on-line algorithms, with an application to finding palindromes
Efficient matching of nonrectangular shapes.
Matching a set of strings with variable length don't cares
Overlap matching.
A filtering algorithm for k-mismatch with don't cares
Pattern matching with wildcards using words of shorter length
Computing primitively-rooted squares and runs in partial words
On string matching with mismatches
Streaming pattern matching with \(d\) wildcards
Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching
Extreme witnesses and their applications
Time-space-optimal string matching
Fast on-line integer multiplication
Fast and practical approximate string matching
Approximate swapped matching.
Approximate congruence in nearly linear time
Two-dimensional pattern matching with rotations
Optimal and nearly optimal algorithms for approximating polynomial zeros
Pattern matching in the Hamming distance with thresholds
String matching with up to k swaps and mismatches
Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth
State complexity of partial word finite automata
Recent advances in text-to-pattern distance algorithms
State complexity of finite partial languages
Exploiting pseudo-locality of interchange distance
Finding patterns and periods in Cartesian tree matching
A new approach to regular \& indeterminate strings
Efficient construction of maximal and minimal representations of motifs of a string
Fast parallel and serial multidimensional approximate array matching
Squares and primitivity in partial words
Approximate periodicity
Inferring an indeterminate string from a prefix graph
On the state complexity of partial word DFAs
New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings
Binary segmentation for matrix and vector operations
Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time
Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform
Longest common substring with approximately \(k\) mismatches
Towards optimal packed string matching
A lower-variance randomized algorithm for approximate string matching
Generalized function matching
Motif patterns in 2D
Extracting approximate patterns
An acceleration of FFT-based algorithms for the match-count problem
A matching algorithm in PMWL based on CluTree
Secure parameterized pattern matching
On the average-case complexity of pattern matching with wildcards
Compact suffix automata representations for searching long patterns
Ternary square-free partial words with many wildcards
An aperiodicity problem for multiwords
Efficient special cases of pattern matching with swaps
Computing primitively-rooted squares and runs in partial words
Set intersection and sequence matching with mismatch counting
Permuted scaled matching
Efficient and secure generalized pattern matching via Fast Fourier Transform
Computing covers using prefix tables
The finite automata approaches in stringology
Faster evaluation of subtraction games
On pattern matching with \(k\) mismatches and few don't cares
Squareable words
A Black Box for Online Approximate Pattern Matching
Algorithms for path-constrained sequence alignment
Indeterminate string inference algorithms
Efficient string matching on packed texts
IDPM: an improved degenerate pattern matching algorithm for biological sequences
Square-free partial words with many wildcards
An algorithmic toolbox for periodic partial words
Indeterminate strings, prefix arrays \& undirected graphs
Simple tree pattern matching for trees in the prefix bar notation
Towards optimal approximate streaming pattern matching by matching multiple patterns in multiple streams
Combinatorial properties of Fibonacci partial words and arrays
Approximating Approximate Pattern Matching
Even faster elastic-degenerate string matching via fast matrix multiplication
scientific article; zbMATH DE number 7250166 (Why is no real title available?)
Faster Online Elastic Degenerate String Matching
Necklaces, convolutions, and \(X+Y\)
Optimal parallel algorithms for periods, palindromes and squares (extended abstract)
A simple algorithm for approximating the text-to-pattern Hamming distance
Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics
Multi-pattern matching algorithm with wildcards based on bit-parallelism
Elastic-Degenerate String Matching via Fast Matrix Multiplication
Algorithms
Nearly optimal computations with structured matrices
The approximate swap and mismatch edit distance
scientific article; zbMATH DE number 7758337 (Why is no real title available?)

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 Q4055156)