Algorithms for approximate string matching
From MaRDI portal
Cited in
(85)- Exploiting distance coherence to speed up range queries in metric indexes
- An integer linear programming approach for approximate string comparison
- Sequence comparison with concave weighting functions
- Dynamic programming with convexity, concavity and sparsity
- Approximate string-matching with q-grams and maximal matches
- A survey of multiple sequence comparison methods
- Efficient algorithms for approximate string matching with swaps
- Performance analysis of some simple heuristics for computing longest common subsequences
- A sublinear algorithm for approximate keyword searching
- Classes of cost functions for string edit distance
- Block edit models for approximate string matching
- Approximate string matching using factor automata
- Efficient merged longest common subsequence algorithms for similar sequences
- Edit distance with block deletions
- Edit distance of run-length encoded strings.
- Finding approximate palindromes in strings
- Discovering instances of poetic allusion from anthologies of classical Japanese poems
- Approximate pattern matching and transitive closure logics.
- Fast approximate matching of words against a dictionary
- Weighted automata computation of edit distances with consolidations and fragmentations
- Approximating the geometric edit distance
- Co-linear chaining with overlaps and gap costs
- Edit distance for a run-length-encoded string and an uncompressed string
- Breadth-first search strategies for trie-based syntactic pattern recognition
- Extending alignments with k-mismatches and -gaps
- Bit-parallel approximate string matching algorithms with transposition
- Document listing on repetitive collections with guaranteed performance
- Levenshtein graphs: resolvability, automorphisms \& determining sets
- Fast Algorithms for Local Similarity Queries in Two Sequences
- VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING
- FINDING ALL APPROXIMATE GAPPED PALINDROMES
- A new practical linear space algorithm for the longest common subsequence problem
- Approximate String Matching: A Simpler Faster Algorithm
- Fast approximate search in large dictionaries
- Refined algorithms for hitting many intervals
- Algorithms for String Pattern Discovery
- APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ †
- New and faster filters for multiple approximate string matching
- On-Line Approximate String Searching Algorithms: Survey and Experimental Results
- scientific article; zbMATH DE number 872102 (Why is no real title available?)
- What's behind blast
- Edit distance with block operations
- Boyer-Moore approach to approximate string matching
- A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm
- Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation
- On locally optimal alignments in genetic sequences
- Longest common subsequences
- Multiple approximate string matching
- A succinct four Russians speedup for edit distance computation and one-against-many banded alignment
- A practical semi-external memory method for approximate pattern matching
- Pattern matching in pseudo real-time
- Deciding word neighborhood with universal neighborhood automata
- A NOVEL ALGORITHM FOR SOLVING THE STRING MATCHING PROBLEM
- A Formal Investigation of Diff3
- A learning algorithm for the longest common subsequence problem
- Average-optimal single and multiple approximate string matching
- EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
- DICTIONARY LOOK-UP WITHIN SMALL EDIT DISTANCE
- FFT-based algorithms for the string matching with mismatches problem
- Closest substring problems for regular languages
- Near optimal multiple alignment within a band in polynomial time
- On the Simon's congruence neighborhood of languages
- Volume formula and growth rates of the balls of strings under the edit distances
- The longest common extension problem revisited and applications to approximate string searching
- On computing exact means of time series using the move-split-merge metric
- Weighted edit distance computation: strings, trees, and Dyck
- A unified view to string matching algorithms
- Privacy-preserving edit distance computation using secret-sharing two-party computation
- An improved algorithm for computing the edit distance of run-length coded strings
- A^*PA2: up to 19 faster exact global alignment
- An algorithm for matching run-length coded strings
- Approximate string matching with suffix automata
- Faster approximate string matching for short patterns
- Approximate similarity search under edit distance using locality-sensitive hashing
- Faster algorithms for bounded tree edit distance
- Edit distance in near-linear time: it's a constant factor
- Faster algorithm for bounded tree edit distance in the low-distance regime
- General methods of sequence comparison
- Communication networks from the enron email corpus ``It's always about the people. Enron is no different
- A novel look-ahead optimization strategy for trie-based approximate string matching
- A dynamic edit distance table
- String matching with weighted errors
- An O(NP) sequence comparison algorithm
- Text indexing with errors
- Efficient algorithms for the block edit problems
This page was built for publication: Algorithms for approximate string matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3694730)
