Pages that link to "Item:Q1079377"
From MaRDI portal
The following pages link to Efficient string matching with k mismatches (Q1079377):
Displaying 50 items.
- Mismatch sampling (Q418198) (← links)
- The approximate swap and mismatch edit distance (Q604463) (← links)
- A fast algorithm for string matching with mismatches (Q672410) (← links)
- A black box for online approximate pattern matching (Q716330) (← links)
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances (Q732031) (← links)
- From Nerode's congruence to suffix automata with mismatches (Q840766) (← links)
- Pattern matching with don't cares and few errors (Q847263) (← links)
- Pattern matching with address errors: rearrangement distances (Q923879) (← links)
- \(k\)-difference matching in amortized linear time for all the words in a text (Q1006084) (← links)
- Parallel string matching with k mismatches (Q1098311) (← links)
- Data structures and algorithms for approximate string matching (Q1104103) (← links)
- Fast string matching with k differences (Q1109574) (← links)
- Matching patterns in strings subject to multi-linear transformations (Q1115200) (← links)
- A filtering algorithm for \(k\)-mismatch with don't cares (Q1675785) (← links)
- Covering problems for partial words and for indeterminate strings (Q1676304) (← links)
- Longest common extension (Q1678103) (← links)
- Streaming pattern matching with \(d\) wildcards (Q1741859) (← links)
- On the string matching with \(k\) mismatches (Q1743717) (← links)
- Verifiable pattern matching on outsourced texts (Q1757465) (← 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)
- Finding approximate palindromes in strings (Q1860243) (← links)
- Multiple filtration and approximate pattern matching (Q1902470) (← links)
- String matching with up to \(k\) swaps and mismatches (Q1959438) (← links)
- Recent advances in text-to-pattern distance algorithms (Q2106622) (← links)
- \(k\)-approximate quasiperiodicity under Hamming and edit distance (Q2118198) (← links)
- Streaming dictionary matching with mismatches (Q2118382) (← links)
- Efficient computation of sequence mappability (Q2134748) (← links)
- String indexing for patterns with wildcards (Q2254487) (← links)
- Approximate periodicity (Q2343134) (← links)
- Swap and mismatch edit distance (Q2369878) (← links)
- Longest common substring with approximately \(k\) mismatches (Q2414870) (← links)
- Verifiable Pattern Matching on Outsourced Texts (Q2827727) (← links)
- Indexing a sequence for mapping reads with a single mismatch (Q2955639) (← links)
- A Black Box for Online Approximate Pattern Matching (Q3506949) (← links)
- Nested Counters in Bit-Parallel String Matching (Q3618593) (← links)
- On-Line Approximate String Searching Algorithms: Survey and Experimental Results (Q4551538) (← links)
- EFFICIENT PARALLEL ALGORITHMS FOR PATTERN RECOGNITION∗ (Q4819983) (← links)
- What’s Behind Blast (Q4992751) (← 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)
- (Q5088893) (← 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)
- Circular pattern matching with \(k\) mismatches (Q5918999) (← links)
- (Q6065473) (← links)
- Maximal degenerate palindromes with gaps and mismatches (Q6073887) (← links)
- Elastic-degenerate string matching with 1 error or mismatch (Q6635705) (← links)
