Pages that link to "Item:Q3799643"
From MaRDI portal
The following pages link to Efficient randomized pattern-matching algorithms (Q3799643):
Displaying 50 items.
- Compressed string dictionary search with edit distance one (Q270017) (← links)
- Permuted scaled matching (Q294926) (← links)
- Indexing and querying color sets of images (Q306719) (← links)
- Fast algorithms for abelian periods in words and greatest common divisor queries (Q340577) (← links)
- Simple real-time constant-space string matching (Q390869) (← links)
- Various improvements to text fingerprinting (Q396662) (← links)
- Compact q-gram profiling of compressed strings (Q401308) (← links)
- Layouts for improved hierarchical parallel computations (Q405569) (← links)
- Simple, compact and robust approximate string dictionary (Q405575) (← links)
- Fast and flexible packed string matching (Q405577) (← links)
- A compact representation of nondeterministic (suffix) automata for the bit-parallel approach (Q418159) (← links)
- Improved space-time tradeoffs for approximate full-text indexing with one edit error (Q494804) (← links)
- Improving deduplication techniques by accelerating remainder calculations (Q496547) (← links)
- Designing optimal- and fast-on-average pattern matching algorithms (Q511153) (← links)
- Resilient dynamic programming (Q513272) (← links)
- Efficient indexes for jumbled pattern matching with constant-sized alphabet (Q524375) (← links)
- Fast searching in packed strings (Q533408) (← links)
- Missing pattern discovery (Q553949) (← links)
- Efficient index for retrieving top-\(k\) most frequent documents (Q616994) (← links)
- A fast algorithm for string matching with mismatches (Q672410) (← links)
- Execution of logic programs by iterative-deepening A\(^*\) SLD-tree search (Q688625) (← links)
- Bounded similarity querying for time-series data (Q703853) (← links)
- LCS approximation via embedding into locally non-repetitive strings (Q716327) (← links)
- Scaled and permuted string matching (Q834966) (← links)
- Fast exact string matching algorithms (Q846013) (← links)
- An analysis of the Karp-Rabin string matching algorithm (Q911281) (← links)
- Hardness of optimal spaced seed design (Q931726) (← links)
- Content-dependent chunking for differential compression, the local maximum approach (Q972380) (← links)
- Improving on-line construction of two-dimensional suffix trees for square matrices (Q987807) (← links)
- Information recovery from randomly mixed-up message text (Q1039019) (← links)
- Average-optimal string matching (Q1044048) (← links)
- Efficient string matching with k mismatches (Q1079377) (← links)
- Distributed algorithms in synchronous broadcasting networks (Q1088398) (← links)
- Fast string matching with k differences (Q1109574) (← links)
- Matching patterns in strings subject to multi-linear transformations (Q1115200) (← links)
- An introduction to randomized algorithms (Q1182319) (← links)
- Approximate string-matching with \(q\)-grams and maximal matches (Q1190465) (← links)
- Identifying periodic occurrences of a template with applications to protein structure (Q1209310) (← links)
- Fast two-dimensional pattern matching (Q1209318) (← links)
- Alphabet-independent optimal parallel search for three-dimensional patterns (Q1275083) (← links)
- Occam's razor, partially specified Boolean functions, string matching, and independent sets (Q1314272) (← links)
- Sublinear approximate string matching and biological applications (Q1336963) (← links)
- Efficient multiway radix search trees (Q1350102) (← links)
- Time-space trade-offs for Lempel-Ziv compressed indexing (Q1694685) (← links)
- Dictionary matching with a bounded gap in pattern or in text (Q1709592) (← links)
- Universal compressed text indexing (Q1729689) (← links)
- A faster quick search algorithm (Q1736618) (← 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)
