The following pages link to (Q3747742):
Displaying 32 items.
- On pattern matching with \(k\) mismatches and few don't cares (Q344551) (← links)
- On approximate pattern matching with thresholds (Q522963) (← links)
- Simple and efficient string matching with k mismatches (Q582093) (← links)
- A fast algorithm for string matching with mismatches (Q672410) (← links)
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances (Q732031) (← links)
- Pattern matching with address errors: rearrangement distances (Q923879) (← links)
- Parallel string matching with k mismatches (Q1098311) (← links)
- Data structures and algorithms for approximate string matching (Q1104103) (← links)
- Period recovery of strings over the Hamming and edit distances (Q1698696) (← links)
- On string matching with mismatches (Q1736652) (← links)
- On the string matching with \(k\) mismatches (Q1743717) (← links)
- A randomized numerical aligner (rNA) (Q1757842) (← links)
- Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching (Q1761497) (← links)
- Fast and practical approximate string matching (Q1847363) (← links)
- Pattern matching in the Hamming distance with thresholds (Q1944111) (← links)
- Multidimensional period recovery (Q2144266) (← links)
- 2-dimensional palindromes with \(k\) mismatches (Q2203604) (← links)
- String indexing for patterns with wildcards (Q2254487) (← links)
- Fast parallel and serial multidimensional approximate array matching (Q2277849) (← links)
- Approximate periodicity (Q2343134) (← links)
- Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time (Q2380069) (← links)
- Locating maximal approximate runs in a string (Q2410363) (← links)
- Extending alignments with \(k\)-mismatches and \(\ell\)-gaps (Q2437749) (← links)
- Checking whether a word is Hamming-isometric in linear time (Q2676462) (← links)
- Double string tandem repeats (Q2700385) (← links)
- Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance (Q2946041) (← links)
- Boyer-Moore approach to approximate string matching (Q5056116) (← links)
- Small-space LCE data structure with constant-time queries (Q5111224) (← links)
- Efficient Identification of k-Closed Strings (Q5859637) (← links)
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions. (Q5874509) (← links)
- Maximal degenerate palindromes with gaps and mismatches (Q6073887) (← links)
- Exact and inexact search for 2d side-sharing tandems (Q6658301) (← links)
