Pages that link to "Item:Q3694730"
From MaRDI portal
The following pages link to Algorithms for approximate string matching (Q3694730):
Displaying 50 items.
- Refined algorithms for hitting many intervals (Q344570) (← links)
- A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm (Q507395) (← links)
- A practical semi-external memory method for approximate pattern matching (Q529654) (← links)
- Pattern matching in pseudo real-time (Q533411) (← links)
- Deciding word neighborhood with universal neighborhood automata (Q533878) (← links)
- The longest common extension problem revisited and applications to approximate string searching (Q616995) (← links)
- An improved algorithm for computing the edit distance of run-length coded strings (Q673470) (← links)
- An algorithm for matching run-length coded strings (Q685867) (← links)
- Approximate string matching with suffix automata (Q689099) (← links)
- Faster approximate string matching for short patterns (Q692899) (← links)
- General methods of sequence comparison (Q799527) (← links)
- Communication networks from the enron email corpus ``It's always about the people. Enron is no different'' (Q812024) (← links)
- A novel look-ahead optimization strategy for trie-based approximate string matching (Q851727) (← links)
- A dynamic edit distance table (Q876720) (← links)
- String matching with weighted errors (Q909451) (← links)
- An O(NP) sequence comparison algorithm (Q912628) (← links)
- Text indexing with errors (Q925060) (← links)
- Efficient algorithms for the block edit problems (Q963999) (← links)
- Exploiting distance coherence to speed up range queries in metric indexes (Q1041769) (← links)
- Sequence comparison with concave weighting functions (Q1101364) (← links)
- Dynamic programming with convexity, concavity and sparsity (Q1190452) (← links)
- Approximate string-matching with \(q\)-grams and maximal matches (Q1190465) (← links)
- A survey of multiple sequence comparison methods (Q1191624) (← links)
- Efficient algorithms for approximate string matching with swaps (Q1288533) (← links)
- Performance analysis of some simple heuristics for computing longest common subsequences (Q1336959) (← links)
- A sublinear algorithm for approximate keyword searching (Q1336965) (← links)
- Classes of cost functions for string edit distance (Q1355732) (← links)
- Block edit models for approximate string matching (Q1391305) (← links)
- Approximate string matching using factor automata (Q1583536) (← links)
- Efficient merged longest common subsequence algorithms for similar sequences (Q1686075) (← links)
- Edit distance with block deletions (Q1736478) (← links)
- Edit distance of run-length encoded strings. (Q1853090) (← links)
- Finding approximate palindromes in strings (Q1860243) (← links)
- Discovering instances of poetic allusion from anthologies of classical Japanese poems (Q1870547) (← links)
- Approximate pattern matching and transitive closure logics. (Q1874401) (← links)
- Fast approximate matching of words against a dictionary (Q1895867) (← links)
- Weighted automata computation of edit distances with consolidations and fragmentations (Q2064523) (← links)
- Approximating the geometric edit distance (Q2165024) (← links)
- Co-linear chaining with overlaps and gap costs (Q2170153) (← links)
- Edit distance for a run-length-encoded string and an uncompressed string (Q2380032) (← links)
- Breadth-first search strategies for trie-based syntactic pattern recognition (Q2383946) (← links)
- Extending alignments with \(k\)-mismatches and \(\ell\)-gaps (Q2437749) (← links)
- Bit-parallel approximate string matching algorithms with transposition (Q2569398) (← links)
- Document listing on repetitive collections with guaranteed performance (Q2632016) (← links)
- Levenshtein graphs: resolvability, automorphisms \& determining sets (Q2689484) (← links)
- Fast Algorithms for Local Similarity Queries in Two Sequences (Q2949727) (← links)
- VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING (Q3021938) (← links)
- FINDING ALL APPROXIMATE GAPPED PALINDROMES (Q3069733) (← links)
- (Q3143773) (← links)
- Fast Approximate Search in Large Dictionaries (Q3225420) (← links)
