scientific article; zbMATH DE number 1044854
From MaRDI portal
Publication:4347080
Cited in
(47)- Discovering subword associations in strings in time linear in the output size
- The constrained longest common subsequence problem
- Sparse LCS common substring alignment
- Parallel construction and query of index data structures for pattern matching on square matrices
- Generalizations of suffix arrays to multi-dimensional matrices.
- Overlap matching.
- Simple and fast linear space computation of longest common subsequences
- The wide window string matching algorithm
- Approximate string matching on Ziv--Lempel compressed text
- Tree pattern matching with a more general notion of occurrence of the pattern.
- A speed-up for the commute between subword trees and DAWGs.
- Compact recognizers of episode sequences
- Collage system: A unifying framework for compressed pattern matching.
- Two-dimensional pattern matching with rotations
- A hierarchical clustering algorithm for categorical sequence data
- Property testing of regular tree languages
- Generalized function matching
- Constrained pattern matching
- Periodicity and Repetitions in Parameterized Strings
- Pattern Matching
- Algorithms for String Pattern Discovery
- Monge properties of sequence alignment
- scientific article; zbMATH DE number 1786459 (Why is no real title available?)
- scientific article; zbMATH DE number 6863589 (Why is no real title available?)
- scientific article; zbMATH DE number 1822176 (Why is no real title available?)
- scientific article; zbMATH DE number 872102 (Why is no real title available?)
- Boosting pattern matching performance via k-bit filtering
- Streaming periodicity with mismatches
- Location-aware real-time recommender systems for brick-and-mortar retailers
- Asynchronous Pattern Matching
- The effect of multiple reference characters on detecting matches in string-searching algorithms
- Generalizations of suffix arrays to multi-dimensional matrices.
- scientific article; zbMATH DE number 7756108 (Why is no real title available?)
- On the hardness of computing the edit distance of shallow trees
- BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation
- Propagation through a barrier: numerical analysis of a reaction-diffusion model with free boundary
- Reconstructing general matching graphs
- Shortest characteristic factors of a deterministic finite automaton and computing its positive position run by pattern set matching
- Scaled and permuted string matching
- Faster two-dimensional pattern matching with rotations
- Motif discovery by monotone scores
- Parameterized matching with mismatches
- Periodicity and repetitions in parameterized strings
- Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time
- Some theoretical challenges in digital geometry: a perspective
- A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
- Parameterized matching on non-linear structures
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 Q4347080)
