Approximate circular pattern matching
From MaRDI portal
Cites work
- Accurate and efficient methods to improve multiple circular sequence alignment
- Approximating text-to-pattern Hamming distances
- Average-case optimal approximate circular string matching
- Average-optimal single and multiple approximate string matching
- Average-optimal string matching
- Bit-Parallel Approximate Matching of Circular Strings with k Mismatches
- Circular pattern matching with \(k\) mismatches
- Clustered Integer 3SUM via Additive Combinatorics
- Deterministic sorting in O(nloglogn) time and linear space
- Fast and simple computations using prefix tables under Hamming and edit distance
- Fast parallel and serial approximate string matching
- Faster approximate pattern matching: a unified approach
- Faster min-plus product for monotone instances
- Generalized String Matching
- scientific article; zbMATH DE number 3471577 (Why is no real title available?)
- scientific article; zbMATH DE number 2183071 (Why is no real title available?)
- Incremental String Comparison
- Log-logarithmic worst-case range queries are possible in space theta(N)
- On hidden Markov models and cyclic strings for shape recognition
- On the complexity of k-SAT
- Path minima queries in dynamic weighted trees
- Quadratic conditional lower bounds for string problems and dynamic time warping
- Searching and indexing circular patterns
- Semi-local string comparison: algorithmic techniques and applications
- Space-efficient construction algorithm for the circular suffix tree
- Submatrix maximum queries in Monge and partial Monge matrices are equivalent to predecessor search
- Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
- Succinct indexes for circular patterns
- The \(k\)-mismatch problem revisited
- Towards unified approximate pattern matching for Hamming and \(L_1\) distance
Cited in
(8)- A textbook solution for dynamic strings
- Searching 2D-strings for matching frames
- Internal pattern matching in small space and applications
- Approximate circular pattern matching under edit distance
- Logarithmic-time internal pattern matching queries in compressed and dynamic texts
- Quasi-linear-time algorithm for a longest common circular factor
- A textbook solution for dynamic strings
- Faster approximate elastic-degenerate string matching. Part A
This page was built for publication: Approximate circular pattern matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969648)
