Pages that link to "Item:Q3694730"

The following pages link to Algorithms for approximate string matching (Q3694730):

Displaying 18 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)
• (Q5009593) (← links)
• Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation (Q5091239) (← links)
• (Q5140776) (← links)
• Volume formula and growth rates of the balls of strings under the edit distances (Q6096340) (← links)
• On computing exact means of time series using the move-split-merge metric (Q6487748) (← links)