Pages that link to "Item:Q3694730"

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

Displaying 22 items.

• APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ † (Q4240887) (← links)
• New and faster filters for multiple approximate string matching (Q4534215) (← links)
• On-Line Approximate String Searching Algorithms: Survey and Experimental Results (Q4551538) (← links)
• What’s Behind Blast (Q4992751) (← links)
• (Q5009593) (← links)
• Boyer-Moore approach to approximate string matching (Q5056116) (← links)
• Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation (Q5091239) (← links)
• On locally optimal alignments in genetic sequences (Q5096800) (← links)
• Longest common subsequences (Q5096874) (← links)
• Multiple approximate string matching (Q5096936) (← links)
• (Q5140776) (← links)
• A Formal Investigation of Diff3 (Q5458859) (← links)
• A learning algorithm for the longest common subsequence problem (Q5463438) (← links)
• Average-optimal single and multiple approximate string matching (Q5463450) (← links)
• EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS (Q5696947) (← links)
• DICTIONARY LOOK-UP WITHIN SMALL EDIT DISTANCE (Q5696965) (← links)
• Closest substring problems for regular languages (Q5918147) (← links)
• Near optimal multiple alignment within a band in polynomial time (Q5925273) (← 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)
• A unified view to string matching algorithms (Q6560185) (← links)
• Privacy-preserving edit distance computation using secret-sharing two-party computation (Q6619924) (← links)