Pages that link to "Item:Q4820884"
From MaRDI portal
The following pages link to Faster algorithms for string matching with k mismatches (Q4820884):
Displaying 50 items.
- Longest common extensions in trees (Q294947) (← links)
- On pattern matching with \(k\) mismatches and few don't cares (Q344551) (← links)
- A new efficient indexing algorithm for one-dimensional real scaled patterns (Q414881) (← links)
- Mismatch sampling (Q418198) (← links)
- Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics (Q534777) (← links)
- The approximate swap and mismatch edit distance (Q604463) (← links)
- A black box for online approximate pattern matching (Q716330) (← links)
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances (Q732031) (← links)
- Pattern matching with don't cares and few errors (Q847263) (← links)
- Pattern matching with address errors: rearrangement distances (Q923879) (← links)
- Matching with don't-cares and a small number of mismatches (Q976093) (← links)
- Hardness of comparing two run-length encoded strings (Q990818) (← links)
- \(k\)-difference matching in amortized linear time for all the words in a text (Q1006084) (← links)
- Permuted function matching (Q1675783) (← links)
- A filtering algorithm for \(k\)-mismatch with don't cares (Q1675785) (← links)
- Longest common extension (Q1678103) (← links)
- On string matching with mismatches (Q1736652) (← links)
- Streaming pattern matching with \(d\) wildcards (Q1741859) (← links)
- On the string matching with \(k\) mismatches (Q1743717) (← links)
- A randomized numerical aligner (rNA) (Q1757842) (← links)
- The indexing for one-dimensional proportionally-scaled strings (Q1944891) (← links)
- String matching with up to \(k\) swaps and mismatches (Q1959438) (← links)
- Recent advances in text-to-pattern distance algorithms (Q2106622) (← links)
- Approximate hashing for bioinformatics (Q2117679) (← links)
- Streaming dictionary matching with mismatches (Q2118382) (← links)
- String indexing for patterns with wildcards (Q2254487) (← links)
- Matchstick puzzles on a grid (Q2308506) (← links)
- On-line string matching in highly similar DNA sequences (Q2363986) (← links)
- \(L_{1}\) pattern matching lower bound (Q2380062) (← links)
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
- Time-space trade-offs for longest common extensions (Q2442815) (← links)
- Approximate pattern matching with \(k\)-mismatches in packed text (Q2445229) (← links)
- Optimal spaced seeds for faster approximate string matching (Q2643727) (← links)
- Checking whether a word is Hamming-isometric in linear time (Q2676462) (← links)
- Time-Space Trade-Offs for Longest Common Extensions (Q2904502) (← links)
- Longest Common Extensions in Trees (Q2942245) (← links)
- Longest Common Extensions in Sublinear Space (Q2942246) (← links)
- On the relationship between histogram indexing and block-mass indexing (Q2955626) (← links)
- Indexing a sequence for mapping reads with a single mismatch (Q2955639) (← links)
- A Black Box for Online Approximate Pattern Matching (Q3506949) (← links)
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard (Q3637111) (← links)
- Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance (Q5002739) (← links)
- Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams (Q5002743) (← links)
- Longest common substring made fully dynamic (Q5075739) (← links)
- Approximating Approximate Pattern Matching (Q5088905) (← links)
- (Q5091170) (← links)
- (Q5136323) (← links)
- Random Access to Grammar-Compressed Strings and Trees (Q5255003) (← links)
- Elastic-Degenerate String Matching via Fast Matrix Multiplication (Q5864665) (← links)
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions. (Q5874509) (← links)
