Elastic-Degenerate String Matching via Fast Matrix Multiplication
From MaRDI portal
Publication:5864665
Recommendations
- Even faster elastic-degenerate string matching via fast matrix multiplication
- Faster Online Elastic Degenerate String Matching
- A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching
- Fast and linear-time string matching algorithms based on the distances of \(q\)-gram occurrences
- Efficient string matching with k mismatches
Cites work
- scientific article; zbMATH DE number 3471577 (Why is no real title available?)
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 2119723 (Why is no real title available?)
- scientific article; zbMATH DE number 7286689 (Why is no real title available?)
- scientific article; zbMATH DE number 3340123 (Why is no real title available?)
- scientific article; zbMATH DE number 3340124 (Why is no real title available?)
- A data structure for dynamic trees
- Algorithms on Strings
- Algorithms – ESA 2004
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Approximate pattern matching on elastic-degenerate text
- Color-distance oracles and snippets
- Comparing Degenerate Strings
- Computing dominances in \(E^ n\)
- Constructing Efficient Dictionaries in Close to Sorting Time
- Efficient determination of the transitive closure of a directed graph
- Even faster elastic-degenerate string matching via fast matrix multiplication
- Factorizing words over an ordered alphabet
- Fast Pattern Matching in Strings
- Fast context-free grammar parsing requires fast Boolean matrix multiplication
- Fast pattern-matching on indeterminate strings
- Faster Online Elastic Degenerate String Matching
- Faster algorithms for string matching with k mismatches
- Finding a Minimum Circuit in a Graph
- Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication
- Finding a maximum weight triangle in n 3-Δ time, with applications
- General context-free recognition in less than cubic time
- Generalized String Matching
- Hardness of RNA folding problem with four symbols
- If the current clique algorithms are optimal, so is Valiant's parser
- Internal pattern matching queries in a text and applications
- Linear time construction of indexable founder block graphs
- Lossless filter for multiple repetitions with Hamming distance
- Multidimensional binary search trees used for associative searching
- Multiplying matrices faster than coppersmith-winograd
- NR-grep: A fast and flexible pattern-matching tool
- On hardness of several string indexing problems
- On-line pattern matching on similar texts
- Pattern matching on elastic-degenerate text with errors
- Powers of tensors and fast matrix multiplication
- Regularity Lemmas and Combinatorial Algorithms
- Simple deterministic wildcard matching
- Speeding up the four Russians algorithm by about one more logarithmic factor
- The complexity of satisfiability of small depth circuits
- Towards unified approximate pattern matching for Hamming and \(L_1\) distance
- Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product
- Two-way string-matching
- Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
- Uniqueness Theorems for Periodic Functions
- Verifying candidate matches in sparse and wildcard matching
Cited in
(6)- Approximate pattern matching on elastic-degenerate text
- scientific article; zbMATH DE number 7286689 (Why is no real title available?)
- Even faster elastic-degenerate string matching via fast matrix multiplication
- Elastic-degenerate string matching with 1 error
- Elastic-degenerate string matching with 1 error or mismatch
- Faster Online Elastic Degenerate String Matching
This page was built for publication: Elastic-Degenerate String Matching via Fast Matrix Multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5864665)