The following pages link to Generalized String Matching (Q3790661):
Displaying 50 items.
- Efficient special cases of pattern matching with swaps (Q293429) (← links)
- Computing covers using prefix tables (Q313747) (← links)
- On pattern matching with \(k\) mismatches and few don't cares (Q344551) (← links)
- Indeterminate string inference algorithms (Q414420) (← links)
- Mismatch sampling (Q418198) (← links)
- Indeterminate strings, prefix arrays \& undirected graphs (Q496001) (← links)
- On approximate pattern matching with thresholds (Q522963) (← 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)
- An algorithm for string matching with a sequence of don't cares (Q750152) (← links)
- Resource scheduling with variable requirements over time (Q835625) (← links)
- Pattern matching with don't cares and few errors (Q847263) (← links)
- Pattern matching with address errors: rearrangement distances (Q923879) (← links)
- Fast pattern-matching on indeterminate strings (Q954954) (← links)
- Matching with don't-cares and a small number of mismatches (Q976093) (← links)
- Hardness of comparing two run-length encoded strings (Q990818) (← links)
- Faster pattern matching with character classes using prime number encoding (Q1004281) (← links)
- \(k\)-difference matching in amortized linear time for all the words in a text (Q1006084) (← links)
- Data structures and algorithms for approximate string matching (Q1104103) (← links)
- Time-space tradeoffs for algebraic problems on general sequential machines (Q1176102) (← links)
- Fast average-case pattern matching by multiplexing sparse tables (Q1190461) (← links)
- Fast algorithms for approximately counting mismatches (Q1313761) (← links)
- Pattern matching in a digitized image (Q1336966) (← links)
- Efficient matching of nonrectangular shapes. (Q1354075) (← links)
- A filtering algorithm for \(k\)-mismatch with don't cares (Q1675785) (← links)
- Covering problems for partial words and for indeterminate strings (Q1676304) (← links)
- Computing primitively-rooted squares and runs in partial words (Q1678102) (← links)
- Longest common extension (Q1678103) (← links)
- Filtering degenerate patterns with application to protein sequence analysis (Q1736559) (← links)
- On string matching with mismatches (Q1736652) (← 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)
- Approximate swapped matching. (Q1853034) (← links)
- Two-dimensional pattern matching with rotations (Q1884920) (← links)
- String matching under a general matching relation (Q1900318) (← links)
- A subquadratic algorithm for approximate limited expression matching (Q1907030) (← links)
- Pattern matching in the Hamming distance with thresholds (Q1944111) (← links)
- Recent advances in text-to-pattern distance algorithms (Q2106622) (← links)
- The complexity of approximate pattern matching on de Bruijn graphs (Q2170154) (← links)
- A new approach to regular \& indeterminate strings (Q2220865) (← links)
- Approximate pattern matching on elastic-degenerate text (Q2297854) (← links)
- Squares and primitivity in partial words (Q2341712) (← links)
- Inferring an indeterminate string from a prefix graph (Q2343296) (← links)
- New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings (Q2363963) (← links)
- On lower bounds for read-\(k\)-times branching programs (Q2366719) (← links)
- Swap and mismatch edit distance (Q2369878) (← links)
- \(L_{1}\) pattern matching lower bound (Q2380062) (← links)
