Pages that link to "Item:Q3580961"

The following pages link to Dictionary matching and indexing with errors and don't cares (Q3580961):

Displayed 50 items.

• A matching algorithm in PMWL based on CluTree (Q265007) ‎ (← links)
• Compressed string dictionary search with edit distance one (Q270017) ‎ (← links)
• Document retrieval with one wildcard (Q287451) ‎ (← links)
• The property suffix tree with dynamic properties (Q294931) ‎ (← links)
• Less space: indexing for queries with wildcards (Q300263) ‎ (← links)
• Compressed indexes for text with wildcards (Q390873) ‎ (← links)
• Simple, compact and robust approximate string dictionary (Q405575) ‎ (← links)
• Approximate all-pairs suffix/prefix overlaps (Q418172) ‎ (← links)
• Improved space-time tradeoffs for approximate full-text indexing with one edit error (Q494804) ‎ (← links)
• Cache-oblivious index for approximate string matching (Q551183) ‎ (← links)
• Fast index for approximate string matching (Q616983) ‎ (← links)
• A linear size index for approximate pattern matching (Q655440) ‎ (← links)
• Index structures for fast similarity search for binary vectors (Q681740) ‎ (← links)
• Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances (Q732031) ‎ (← links)
• Approximate string matching using compressed suffix arrays (Q818136) ‎ (← links)
• A metric index for approximate string matching (Q818138) ‎ (← links)
• From Nerode's congruence to suffix automata with mismatches (Q840766) ‎ (← links)
• Pattern matching with don't cares and few errors (Q847263) ‎ (← links)
• Motif discovery by monotone scores (Q876467) ‎ (← links)
• Pattern matching with address errors: rearrangement distances (Q923879) ‎ (← links)
• Text indexing with errors (Q925060) ‎ (← links)
• Improved approximate string matching using compressed suffix data structures (Q930602) ‎ (← links)
• Property matching and weighted matching (Q932325) ‎ (← links)
• Optimal prefix and suffix queries on texts (Q975480) ‎ (← links)
• \(k\)-difference matching in amortized linear time for all the words in a text (Q1006084) ‎ (← links)
• A new method for approximate indexing and dictionary lookup with one error (Q1044734) ‎ (← links)
• Approximate string matching with compressed indexes (Q1662494) ‎ (← links)
• A filtering algorithm for \(k\)-mismatch with don't cares (Q1675785) ‎ (← links)
• On building minimal automaton for subset matching queries (Q1675873) ‎ (← links)
• Dictionary matching with a bounded gap in pattern or in text (Q1709592) ‎ (← links)
• On the string matching with \(k\) mismatches (Q1743717) ‎ (← links)
• Dynamic relative compression, dynamic partial sums, and substring concatenation (Q1755738) ‎ (← links)
• String matching with up to \(k\) swaps and mismatches (Q1959438) ‎ (← links)
• Internal dictionary matching (Q2037109) ‎ (← links)
• A comparative study of dictionary matching with gaps: limitations, techniques and challenges (Q2118199) ‎ (← links)
• Streaming dictionary matching with mismatches (Q2118382) ‎ (← links)
• Efficient computation of sequence mappability (Q2134748) ‎ (← links)
• Online recognition of dictionary with one gap (Q2216131) ‎ (← links)
• String indexing for patterns with wildcards (Q2254487) ‎ (← links)
• Maximal intersection queries in randomized input models (Q2268345) ‎ (← links)
• Succinct non-overlapping indexing (Q2285052) ‎ (← links)
• Index structures for fast similarity search for symbol strings (Q2287426) ‎ (← links)
• Off-line and on-line algorithms for closed string factorization (Q2326384) ‎ (← links)
• A note on the longest common substring with \(k\)-mismatches problem (Q2345875) ‎ (← links)
• Dictionary matching with a few gaps (Q2346375) ‎ (← links)
• Compressing dictionary matching index via sparsification technique (Q2354027) ‎ (← links)
• Breadth-first search strategies for trie-based syntactic pattern recognition (Q2383946) ‎ (← links)
• Indexing factors with gaps (Q2391183) ‎ (← links)
• Mind the gap! (Q2414857) ‎ (← links)
• Compressed text indexing with wildcards (Q2434928) ‎ (← links)