Faster algorithms for string matching with k mismatches
From MaRDI portal
Recommendations
Cited in
(77)- Matchstick puzzles on a grid
- Optimal spaced seeds for faster approximate string matching
- Pattern matching with address errors: rearrangement distances
- A linear-time algorithm for the 1-mismatch problem
- Finding Witnesses by Peeling
- Circular pattern matching with \(k\) mismatches
- Circular pattern matching with \(k\) mismatches
- Fast convolutions and their applications in approximate string matching
- Fast and practical approximate string matching
- Approximate pattern matching with \(k\)-mismatches in packed text
- On pattern matching with \(k\) mismatches and few don't cares
- Time-space trade-offs for longest common extensions
- Longest common extensions in sublinear space
- Two problems about recovering of damaged strings
- scientific article; zbMATH DE number 1445379 (Why is no real title available?)
- Approximate hashing for bioinformatics
- Streaming dictionary matching with mismatches
- Hardness of comparing two run-length encoded strings
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard
- Finding witnesses by peeling
- A Black Box for Online Approximate Pattern Matching
- A new efficient indexing algorithm for one-dimensional real scaled patterns
- Fast average-case pattern matching by multiplexing sparse tables
- An analysis of the Karp-Rabin string matching algorithm
- Elastic-degenerate string matching with 1 error
- On string matching with mismatches
- Elastic-Degenerate String Matching via Fast Matrix Multiplication
- Towards optimal approximate streaming pattern matching by matching multiple patterns in multiple streams
- On the string matching with \(k\) mismatches
- Approximating Approximate Pattern Matching
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances
- Streaming pattern matching with \(d\) wildcards
- The indexing for one-dimensional proportionally-scaled strings
- Towards unified approximate pattern matching for Hamming and \(L_1\) distance
- Simple and efficient string matching with k mismatches
- The \(k\)-mismatch problem revisited
- The approximate swap and mismatch edit distance
- Streaming \(k\)-mismatch with error correcting and applications
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs
- A randomized numerical aligner (rNA)
- A black box for online approximate pattern matching
- EFFICIENT ALGORITHMS FOR (δ,γ,α) AND (δ, kΔ, α)-MATCHING
- Permuted function matching
- Pattern matching with don't cares and few errors
- Mismatch sampling
- Fast string matching with k differences
- \(k\)-difference matching in amortized linear time for all the words in a text
- Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time
- Recent advances in text-to-pattern distance algorithms
- Matching with don't-cares and a small number of mismatches
- Fast algorithms for approximately counting mismatches
- A filtering algorithm for \(k\)-mismatch with don't cares
- Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics
- Longest common substring made fully dynamic
- Longest common extension
- String matching with up to \(k\) swaps and mismatches
- On the relationship between histogram indexing and block-mass indexing
- Longest common extensions in trees
- Efficient string matching with k mismatches
- Longest common extensions in trees
- Even faster elastic-degenerate string matching via fast matrix multiplication
- Time-Space Trade-Offs for Longest Common Extensions
- A faster algorithm for matching a set of patterns with variable length don't cares
- Random access to grammar-compressed strings and trees
- \(L_{1}\) pattern matching lower bound
- Modulated string searching
- Indexing a sequence for mapping reads with a single mismatch
- On-line string matching in highly similar DNA sequences
- A randomized numerical aligner (rNA)
- FFT-based algorithms for the string matching with mismatches problem
- scientific article; zbMATH DE number 7758348 (Why is no real title available?)
- Streaming for aibohphobes: longest palindrome with mismatches
- Two glass balls and a tower
- Checking whether a word is Hamming-isometric in linear time
- Elastic-degenerate string matching with 1 error or mismatch
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions.
- Few matches or almost periodicity: faster pattern matching with mismatches in compressed texts
This page was built for publication: Faster algorithms for string matching with k mismatches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820884)
